mirror of
https://github.com/nlohmann/json.git
synced 2026-11-13 15:35:23 +00:00
Compare commits
1
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
964b433dc7 |
No files matched your search
@@ -27,7 +27,7 @@ comparison of two [`json_view`](../basic_json_view/index.md) documents has a fix
|
|||||||
and does not depend on it either.
|
and does not depend on it either.
|
||||||
|
|
||||||
The call stack that these operations need grows with the limit: roughly *a few kilobytes plus a cost per level times the
|
The call stack that these operations need grows with the limit: roughly *a few kilobytes plus a cost per level times the
|
||||||
limit*, where the cost per level is up to about 2.3 KiB in an unoptimized and up to about 0.5 KiB in an optimized build
|
limit*, where the cost per level is up to about 1.8 KiB in an unoptimized and up to about 0.5 KiB in an optimized build
|
||||||
(see [Stack needed](#stack-needed)). The default of `128` levels is tuned for threads with ordinary stacks of a few
|
(see [Stack needed](#stack-needed)). The default of `128` levels is tuned for threads with ordinary stacks of a few
|
||||||
hundred kilobytes or more. Set a lower limit if your threads have small stacks (RTOS tasks, fibers, threads of the musl
|
hundred kilobytes or more. Set a lower limit if your threads have small stacks (RTOS tasks, fibers, threads of the musl
|
||||||
C
|
C
|
||||||
@@ -67,7 +67,7 @@ When the macro is not defined, the library defines it to its default value.
|
|||||||
the levels that are descended into are counted, so the count never exceeds the limit, not even when user code (a
|
the levels that are descended into are counted, so the count never exceeds the limit, not even when user code (a
|
||||||
copy constructor of a custom base class, say) copies a value while a copy is going on. A byte holds `255` at
|
copy constructor of a custom base class, say) copies a value while a copy is going on. A byte holds `255` at
|
||||||
most, and the limit stays below that, so that the count cannot wrap around. (More levels would hardly be
|
most, and the limit stays below that, so that the count cannot wrap around. (More levels would hardly be
|
||||||
useful: `254` levels need up to 576 KiB of stack in an unoptimized build already, twice as much as the
|
useful: `254` levels need up to 448 KiB of stack in an unoptimized build already, twice as much as the
|
||||||
default.)
|
default.)
|
||||||
|
|
||||||
### Stack needed
|
### Stack needed
|
||||||
@@ -83,7 +83,7 @@ Unoptimized (`-O0`):
|
|||||||
|
|
||||||
| Operation | limit 16 | limit 32 | limit 64 | limit 128 | limit 254 |
|
| Operation | limit 16 | limit 32 | limit 64 | limit 128 | limit 254 |
|
||||||
|---|---:|---:|---:|---:|---:|
|
|---|---:|---:|---:|---:|---:|
|
||||||
| `dump()` and `dump(indent)`, `operator<<` | 48 / 32 | 80 / 64 | 144 / 128 | 288 / 256 | 576 / 512 |
|
| `dump()` and `dump(indent)`, `operator<<` | 16 / 16 | 16 / 16 | 32 / 32 | 48 / 48 | 96 / 96 |
|
||||||
| copy construction and assignment | 32 / 16 | 48 / 32 | 112 / 80 | 224 / 144 | 432 / 304 |
|
| copy construction and assignment | 32 / 16 | 48 / 32 | 112 / 80 | 224 / 144 | 432 / 304 |
|
||||||
| `==` | 16 / 16 | 16 / 16 | 16 / 16 | 48 / 32 | 96 / 48 |
|
| `==` | 16 / 16 | 16 / 16 | 16 / 16 | 48 / 32 | 96 / 48 |
|
||||||
| `<=>` (C++20) | 16 / 16 | 16 / 16 | 32 / 32 | 64 / 64 | 144 / 128 |
|
| `<=>` (C++20) | 16 / 16 | 16 / 16 | 32 / 32 | 64 / 64 | 144 / 128 |
|
||||||
@@ -123,23 +123,24 @@ The rule of thumb is
|
|||||||
|
|
||||||
> stack needed ≈ a few KiB + cost per level × limit
|
> stack needed ≈ a few KiB + cost per level × limit
|
||||||
|
|
||||||
with a cost per level of up to 2.3 KiB (`dump` at `-O0` with Clang; 2.1 KiB with GCC), 1.7 KiB for copying and merging
|
with a cost per level of up to 1.8 KiB (conversion to another `basic_json` type at `-O0` with Clang; 1.3 KiB with
|
||||||
(1.3 KiB with GCC), and 0.1 to 0.5 KiB for most other operations at `-O0`; and 0.5 KiB or less at `-O2`. The numbers
|
GCC), 1.7 KiB for copying and merging (1.3 KiB with GCC), 0.4 KiB for `dump`, and 0.1 to 0.5 KiB for most other
|
||||||
come from the difference between the limits `128` and `254` in the tables, so they are rough: other compilers,
|
operations at `-O0`; and 0.5 KiB or less at `-O2`. The numbers come from the difference between the limits `128` and
|
||||||
other targets (the frames of x86-64 code are about as large), other standard libraries, `JSON_DIAGNOSTICS`, and
|
`254` in the tables, so they are rough: other compilers, other targets (the frames of x86-64 code are about as large),
|
||||||
sanitizers change them. Measure with your own tool chain (see the example below) rather than relying on the tables.
|
other standard libraries, `JSON_DIAGNOSTICS`, and sanitizers change them. Measure with your own tool chain (see the
|
||||||
The stack that your own code and the operating system need comes on top of these numbers.
|
example below) rather than relying on the tables. The stack that your own code and the operating system need comes on
|
||||||
|
top of these numbers.
|
||||||
|
|
||||||
Which limit to choose, for the stack that you can spare for the library (the largest limit of those measured
|
Which limit to choose, for the stack that you can spare for the library (the largest limit of those measured
|
||||||
for which the slowest operation needs at most that much):
|
for which the slowest operation needs at most that much):
|
||||||
|
|
||||||
| Stack for the library | optimized (`-O2`) | unoptimized (`-O0`) |
|
| Stack for the library | optimized (`-O2`) | unoptimized (`-O0`) |
|
||||||
|---|---:|---:|
|
|---|---:|---:|
|
||||||
| 32 KiB | 64 | 0 |
|
| 32 KiB | 64 | 16 |
|
||||||
| 64 KiB | 128 | 16 |
|
| 64 KiB | 128 | 32 |
|
||||||
| 128 KiB (the default stack of threads on musl) | 254 | 32 |
|
| 128 KiB (the default stack of threads on musl) | 254 | 64 |
|
||||||
| 256 KiB | 254 | 64 |
|
| 256 KiB | 254 | 128 |
|
||||||
| 512 KiB | 254 | 128 |
|
| 512 KiB | 254 | 254 |
|
||||||
| 1 MiB or more | 254 | 254 |
|
| 1 MiB or more | 254 | 254 |
|
||||||
|
|
||||||
### Speed
|
### Speed
|
||||||
|
|||||||
@@ -64,13 +64,13 @@ stack for the nesting.)
|
|||||||
|
|
||||||
The call stack still needs room for the levels that are recursed into, and the default limit assumes a stack of ordinary
|
The call stack still needs room for the levels that are recursed into, and the default limit assumes a stack of ordinary
|
||||||
size. The stack that an operation needs is roughly proportional to the limit; with the default of 128 levels, the most
|
size. The stack that an operation needs is roughly proportional to the limit; with the default of 128 levels, the most
|
||||||
demanding operation (`dump` in an unoptimized build) needed up to 288 KiB, and an optimized build needed 48 KiB or less,
|
demanding operations (copying a value and converting it to another `basic_json` type, in an unoptimized build) needed
|
||||||
in measurements on macOS with arm64. The most demanding operation needed this much stack at the limits `0`, `32`,
|
up to 224 KiB, and an optimized build needed 48 KiB or less, in measurements on macOS with arm64. The most demanding
|
||||||
`128`, and `254`:
|
operation needed this much stack at the limits `0`, `32`, `128`, and `254`:
|
||||||
|
|
||||||
| Stack needed, in KiB | limit 0 | limit 32 | limit 128 (default) | limit 254 |
|
| Stack needed, in KiB | limit 0 | limit 32 | limit 128 (default) | limit 254 |
|
||||||
|---|---:|---:|---:|---:|
|
|---|---:|---:|---:|---:|
|
||||||
| unoptimized build (`-O0`) | 16 or less | 80 | 288 | 576 |
|
| unoptimized build (`-O0`) | 16 or less | 64 | 224 | 448 |
|
||||||
| optimized build (`-O2`) | 16 or less | 16 or less | 48 | 112 |
|
| optimized build (`-O2`) | 16 or less | 16 or less | 48 | 112 |
|
||||||
|
|
||||||
A thread with a smaller stack (a task of a real-time operating system, a fiber, or a thread of the musl C library, whose
|
A thread with a smaller stack (a task of a real-time operating system, a fiber, or a thread of the musl C library, whose
|
||||||
|
|||||||
@@ -230,6 +230,16 @@
|
|||||||
// detail/recursion_depth_limit.hpp. Like JSON_NO_THREAD_LOCAL it is neither part
|
// detail/recursion_depth_limit.hpp. Like JSON_NO_THREAD_LOCAL it is neither part
|
||||||
// of the ABI tag nor undefined at the end of json.hpp.
|
// of the ABI tag nor undefined at the end of json.hpp.
|
||||||
|
|
||||||
|
// forced inlining of the serializer's helpers only in optimized builds: at -O0,
|
||||||
|
// GCC and Clang give every inlined copy its own stack slots, which made the
|
||||||
|
// recursive frame of serializer::dump_container() about 2.3 KB (MSVC does not
|
||||||
|
// expand __forceinline at /Ob0, so it keeps it)
|
||||||
|
#if defined(__OPTIMIZE__) || defined(_MSC_VER)
|
||||||
|
#define JSON_INTERNAL_SERIALIZER_INLINE JSON_HEDLEY_ALWAYS_INLINE
|
||||||
|
#else
|
||||||
|
#define JSON_INTERNAL_SERIALIZER_INLINE inline
|
||||||
|
#endif
|
||||||
|
|
||||||
// allow disabling exceptions
|
// allow disabling exceptions
|
||||||
#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
|
#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
|
||||||
#define JSON_THROW(exception) throw exception
|
#define JSON_THROW(exception) throw exception
|
||||||
|
|||||||
@@ -11,6 +11,7 @@
|
|||||||
// clean up
|
// clean up
|
||||||
#undef JSON_ASSERT
|
#undef JSON_ASSERT
|
||||||
#undef JSON_INTERNAL_CATCH
|
#undef JSON_INTERNAL_CATCH
|
||||||
|
#undef JSON_INTERNAL_SERIALIZER_INLINE
|
||||||
#undef JSON_THROW
|
#undef JSON_THROW
|
||||||
#undef JSON_PRIVATE_UNLESS_TESTED
|
#undef JSON_PRIVATE_UNLESS_TESTED
|
||||||
#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
|
#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
|
||||||
|
|||||||
@@ -265,7 +265,7 @@ class serializer
|
|||||||
for a container; writing them from here spares each the entry and exit of
|
for a container; writing them from here spares each the entry and exit of
|
||||||
that function.
|
that function.
|
||||||
*/
|
*/
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void dump_element(const BasicJsonType& val,
|
JSON_INTERNAL_SERIALIZER_INLINE void dump_element(const BasicJsonType& val,
|
||||||
const std::size_t current_indent,
|
const std::size_t current_indent,
|
||||||
const std::size_t depth)
|
const std::size_t depth)
|
||||||
{
|
{
|
||||||
@@ -971,7 +971,7 @@ class serializer
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// write out the bytes pending in @ref string_buffer and reset @a bytes
|
/// write out the bytes pending in @ref string_buffer and reset @a bytes
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void emit_pending(std::size_t& bytes)
|
JSON_INTERNAL_SERIALIZER_INLINE void emit_pending(std::size_t& bytes)
|
||||||
{
|
{
|
||||||
if (bytes != 0)
|
if (bytes != 0)
|
||||||
{
|
{
|
||||||
@@ -983,7 +983,7 @@ class serializer
|
|||||||
/// write buffer and reset index if fewer than 13 bytes are left, as this
|
/// write buffer and reset index if fewer than 13 bytes are left, as this
|
||||||
/// is the maximal number of bytes to be written ("\uxxxx\uxxxx\0") for one
|
/// is the maximal number of bytes to be written ("\uxxxx\uxxxx\0") for one
|
||||||
/// code point
|
/// code point
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void reserve_string_buffer(std::size_t& bytes)
|
JSON_INTERNAL_SERIALIZER_INLINE void reserve_string_buffer(std::size_t& bytes)
|
||||||
{
|
{
|
||||||
if (string_buffer.size() - bytes < 13)
|
if (string_buffer.size() - bytes < 13)
|
||||||
{
|
{
|
||||||
@@ -1344,7 +1344,7 @@ class serializer
|
|||||||
inlining both into the pretty-printing loops once @ref dump_escaped
|
inlining both into the pretty-printing loops once @ref dump_escaped
|
||||||
has grown, which made indented output up to 13% slower
|
has grown, which made indented output up to 13% slower
|
||||||
*/
|
*/
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_indent(std::size_t indent)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_indent(std::size_t indent)
|
||||||
{
|
{
|
||||||
// closing braces at the outermost level ask for no indentation at all
|
// closing braces at the outermost level ask for no indentation at all
|
||||||
if (indent == 0)
|
if (indent == 0)
|
||||||
@@ -1398,7 +1398,7 @@ class serializer
|
|||||||
its room and four stores of the indentation, see @ref put_short_literal_indent.
|
its room and four stores of the indentation, see @ref put_short_literal_indent.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
if (JSON_HEDLEY_LIKELY(put_short_literal_indent(s, indent)))
|
if (JSON_HEDLEY_LIKELY(put_short_literal_indent(s, indent)))
|
||||||
{
|
{
|
||||||
@@ -1418,7 +1418,7 @@ class serializer
|
|||||||
@a indent is wider or the write buffer lacks the room.
|
@a indent is wider or the write buffer lacks the room.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE bool put_short_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE bool put_short_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
constexpr std::size_t length = N - 1;
|
constexpr std::size_t length = N - 1;
|
||||||
if (indent > 32 || write_buffer_pos + length + 32 > write_buffer.size())
|
if (indent > 32 || write_buffer_pos + length + 32 > write_buffer.size())
|
||||||
@@ -1445,7 +1445,7 @@ class serializer
|
|||||||
write-through path for oversized runs.
|
write-through path for oversized runs.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_literal(const char (&s)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_literal(const char (&s)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
static_assert(N >= 2, "put_literal expects a non-empty string literal");
|
static_assert(N >= 2, "put_literal expects a non-empty string literal");
|
||||||
// the array bound counts the terminating NUL, which is not written
|
// the array bound counts the terminating NUL, which is not written
|
||||||
|
|||||||
Generated
+18
-7
@@ -2603,6 +2603,16 @@ JSON_HEDLEY_DIAGNOSTIC_POP
|
|||||||
// detail/recursion_depth_limit.hpp. Like JSON_NO_THREAD_LOCAL it is neither part
|
// detail/recursion_depth_limit.hpp. Like JSON_NO_THREAD_LOCAL it is neither part
|
||||||
// of the ABI tag nor undefined at the end of json.hpp.
|
// of the ABI tag nor undefined at the end of json.hpp.
|
||||||
|
|
||||||
|
// forced inlining of the serializer's helpers only in optimized builds: at -O0,
|
||||||
|
// GCC and Clang give every inlined copy its own stack slots, which made the
|
||||||
|
// recursive frame of serializer::dump_container() about 2.3 KB (MSVC does not
|
||||||
|
// expand __forceinline at /Ob0, so it keeps it)
|
||||||
|
#if defined(__OPTIMIZE__) || defined(_MSC_VER)
|
||||||
|
#define JSON_INTERNAL_SERIALIZER_INLINE JSON_HEDLEY_ALWAYS_INLINE
|
||||||
|
#else
|
||||||
|
#define JSON_INTERNAL_SERIALIZER_INLINE inline
|
||||||
|
#endif
|
||||||
|
|
||||||
// allow disabling exceptions
|
// allow disabling exceptions
|
||||||
#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
|
#if (defined(__cpp_exceptions) || defined(__EXCEPTIONS) || defined(_CPPUNWIND)) && !defined(JSON_NOEXCEPTION)
|
||||||
#define JSON_THROW(exception) throw exception
|
#define JSON_THROW(exception) throw exception
|
||||||
@@ -36985,7 +36995,7 @@ class serializer
|
|||||||
for a container; writing them from here spares each the entry and exit of
|
for a container; writing them from here spares each the entry and exit of
|
||||||
that function.
|
that function.
|
||||||
*/
|
*/
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void dump_element(const BasicJsonType& val,
|
JSON_INTERNAL_SERIALIZER_INLINE void dump_element(const BasicJsonType& val,
|
||||||
const std::size_t current_indent,
|
const std::size_t current_indent,
|
||||||
const std::size_t depth)
|
const std::size_t depth)
|
||||||
{
|
{
|
||||||
@@ -37691,7 +37701,7 @@ class serializer
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// write out the bytes pending in @ref string_buffer and reset @a bytes
|
/// write out the bytes pending in @ref string_buffer and reset @a bytes
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void emit_pending(std::size_t& bytes)
|
JSON_INTERNAL_SERIALIZER_INLINE void emit_pending(std::size_t& bytes)
|
||||||
{
|
{
|
||||||
if (bytes != 0)
|
if (bytes != 0)
|
||||||
{
|
{
|
||||||
@@ -37703,7 +37713,7 @@ class serializer
|
|||||||
/// write buffer and reset index if fewer than 13 bytes are left, as this
|
/// write buffer and reset index if fewer than 13 bytes are left, as this
|
||||||
/// is the maximal number of bytes to be written ("\uxxxx\uxxxx\0") for one
|
/// is the maximal number of bytes to be written ("\uxxxx\uxxxx\0") for one
|
||||||
/// code point
|
/// code point
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void reserve_string_buffer(std::size_t& bytes)
|
JSON_INTERNAL_SERIALIZER_INLINE void reserve_string_buffer(std::size_t& bytes)
|
||||||
{
|
{
|
||||||
if (string_buffer.size() - bytes < 13)
|
if (string_buffer.size() - bytes < 13)
|
||||||
{
|
{
|
||||||
@@ -38064,7 +38074,7 @@ class serializer
|
|||||||
inlining both into the pretty-printing loops once @ref dump_escaped
|
inlining both into the pretty-printing loops once @ref dump_escaped
|
||||||
has grown, which made indented output up to 13% slower
|
has grown, which made indented output up to 13% slower
|
||||||
*/
|
*/
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_indent(std::size_t indent)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_indent(std::size_t indent)
|
||||||
{
|
{
|
||||||
// closing braces at the outermost level ask for no indentation at all
|
// closing braces at the outermost level ask for no indentation at all
|
||||||
if (indent == 0)
|
if (indent == 0)
|
||||||
@@ -38118,7 +38128,7 @@ class serializer
|
|||||||
its room and four stores of the indentation, see @ref put_short_literal_indent.
|
its room and four stores of the indentation, see @ref put_short_literal_indent.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
if (JSON_HEDLEY_LIKELY(put_short_literal_indent(s, indent)))
|
if (JSON_HEDLEY_LIKELY(put_short_literal_indent(s, indent)))
|
||||||
{
|
{
|
||||||
@@ -38138,7 +38148,7 @@ class serializer
|
|||||||
@a indent is wider or the write buffer lacks the room.
|
@a indent is wider or the write buffer lacks the room.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE bool put_short_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE bool put_short_literal_indent(const char (&s)[N], const std::size_t indent) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
constexpr std::size_t length = N - 1;
|
constexpr std::size_t length = N - 1;
|
||||||
if (indent > 32 || write_buffer_pos + length + 32 > write_buffer.size())
|
if (indent > 32 || write_buffer_pos + length + 32 > write_buffer.size())
|
||||||
@@ -38165,7 +38175,7 @@ class serializer
|
|||||||
write-through path for oversized runs.
|
write-through path for oversized runs.
|
||||||
*/
|
*/
|
||||||
template<std::size_t N>
|
template<std::size_t N>
|
||||||
JSON_HEDLEY_ALWAYS_INLINE void put_literal(const char (&s)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
JSON_INTERNAL_SERIALIZER_INLINE void put_literal(const char (&s)[N]) // NOLINT(cppcoreguidelines-avoid-c-arrays,hicpp-avoid-c-arrays,modernize-avoid-c-arrays)
|
||||||
{
|
{
|
||||||
static_assert(N >= 2, "put_literal expects a non-empty string literal");
|
static_assert(N >= 2, "put_literal expects a non-empty string literal");
|
||||||
// the array bound counts the terminating NUL, which is not written
|
// the array bound counts the terminating NUL, which is not written
|
||||||
@@ -47885,6 +47895,7 @@ struct formatter<nlohmann::NLOHMANN_BASIC_JSON_TPL, char> // NOLINT(cert-dcl58-c
|
|||||||
// clean up
|
// clean up
|
||||||
#undef JSON_ASSERT
|
#undef JSON_ASSERT
|
||||||
#undef JSON_INTERNAL_CATCH
|
#undef JSON_INTERNAL_CATCH
|
||||||
|
#undef JSON_INTERNAL_SERIALIZER_INLINE
|
||||||
#undef JSON_THROW
|
#undef JSON_THROW
|
||||||
#undef JSON_PRIVATE_UNLESS_TESTED
|
#undef JSON_PRIVATE_UNLESS_TESTED
|
||||||
#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
|
#undef NLOHMANN_BASIC_JSON_TPL_DECLARATION
|
||||||
|
|||||||
Reference in new issue
Block a user