mirror of
https://github.com/nlohmann/json.git
synced 2026-09-06 16:27:59 +00:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
2e3393b45c | ||
|
|
0236475eef |
@@ -1,4 +1,4 @@
|
|||||||
.PHONY: pretty clean ChangeLog.md release update_hedley update_hedley_undef
|
.PHONY: pretty clean ChangeLog.md release
|
||||||
|
|
||||||
##########################################################################
|
##########################################################################
|
||||||
# configuration
|
# configuration
|
||||||
@@ -41,8 +41,6 @@ all:
|
|||||||
@echo "fuzz_testing_ubjson - prepare fuzz testing of the UBJSON parser"
|
@echo "fuzz_testing_ubjson - prepare fuzz testing of the UBJSON parser"
|
||||||
@echo "pretty - beautify code with Artistic Style"
|
@echo "pretty - beautify code with Artistic Style"
|
||||||
@echo "run_benchmarks - build and run benchmarks"
|
@echo "run_benchmarks - build and run benchmarks"
|
||||||
@echo "update_hedley - download Hedley and regenerate hedley.hpp / hedley_undef.hpp"
|
|
||||||
@echo "update_hedley_undef - rebuild hedley_undef.hpp from the JSON_HEDLEY_* #define names in hedley.hpp"
|
|
||||||
|
|
||||||
|
|
||||||
##########################################################################
|
##########################################################################
|
||||||
@@ -243,24 +241,11 @@ update_hedley:
|
|||||||
rm -f include/nlohmann/thirdparty/hedley/hedley.hpp include/nlohmann/thirdparty/hedley/hedley_undef.hpp
|
rm -f include/nlohmann/thirdparty/hedley/hedley.hpp include/nlohmann/thirdparty/hedley/hedley_undef.hpp
|
||||||
curl https://raw.githubusercontent.com/nemequ/hedley/master/hedley.h -o include/nlohmann/thirdparty/hedley/hedley.hpp
|
curl https://raw.githubusercontent.com/nemequ/hedley/master/hedley.h -o include/nlohmann/thirdparty/hedley/hedley.hpp
|
||||||
$(SED) -i 's/HEDLEY_/JSON_HEDLEY_/g' include/nlohmann/thirdparty/hedley/hedley.hpp
|
$(SED) -i 's/HEDLEY_/JSON_HEDLEY_/g' include/nlohmann/thirdparty/hedley/hedley.hpp
|
||||||
|
grep "[[:blank:]]*#[[:blank:]]*undef" include/nlohmann/thirdparty/hedley/hedley.hpp | grep -v "__" | sort | uniq | $(SED) 's/ //g' | $(SED) 's/undef/undef /g' > include/nlohmann/thirdparty/hedley/hedley_undef.hpp
|
||||||
$(SED) -i '1s/^/#pragma once\n\n/' include/nlohmann/thirdparty/hedley/hedley.hpp
|
$(SED) -i '1s/^/#pragma once\n\n/' include/nlohmann/thirdparty/hedley/hedley.hpp
|
||||||
$(MAKE) update_hedley_undef
|
$(SED) -i '1s/^/#pragma once\n\n/' include/nlohmann/thirdparty/hedley/hedley_undef.hpp
|
||||||
$(MAKE) amalgamate
|
$(MAKE) amalgamate
|
||||||
|
|
||||||
# Rebuild hedley_undef.hpp from every JSON_HEDLEY_* name that hedley.hpp
|
|
||||||
# #defines. Hedley does not #undef all of its public macros internally (see
|
|
||||||
# #5408), so grepping those #undef lines misses names such as
|
|
||||||
# JSON_HEDLEY_PRAGMA. cmake/scripts/gen_hedley_undef_check.cmake is the
|
|
||||||
# single source of truth for this extraction (tests/CMakeLists.txt uses the
|
|
||||||
# same script, in MODE=checks, to generate the matching leak-check test), so
|
|
||||||
# the vendored header, the generated #undef list, and the regression test
|
|
||||||
# cannot drift apart.
|
|
||||||
update_hedley_undef:
|
|
||||||
cmake -DHEDLEY_HPP=include/nlohmann/thirdparty/hedley/hedley.hpp \
|
|
||||||
-DOUTPUT=include/nlohmann/thirdparty/hedley/hedley_undef.hpp \
|
|
||||||
-DMODE=undef \
|
|
||||||
-P cmake/scripts/gen_hedley_undef_check.cmake
|
|
||||||
|
|
||||||
##########################################################################
|
##########################################################################
|
||||||
# serve_header.py
|
# serve_header.py
|
||||||
##########################################################################
|
##########################################################################
|
||||||
|
|||||||
@@ -1,112 +0,0 @@
|
|||||||
# Shared extractor for the JSON_HEDLEY_* macro names defined in hedley.hpp.
|
|
||||||
#
|
|
||||||
# Every macro that hedley.hpp #defines must be #undef-ed again once json.hpp
|
|
||||||
# has been fully processed (see include/nlohmann/detail/macro_unscope.hpp
|
|
||||||
# and https://github.com/nlohmann/json/issues/5408). Deriving the macro list
|
|
||||||
# straight from hedley.hpp here -- instead of hand-maintaining it in two
|
|
||||||
# places -- means hedley_undef.hpp and the regression test that checks for
|
|
||||||
# leaked macros can never drift apart, even after a future `make
|
|
||||||
# update_hedley` pulls in new macros from upstream Hedley.
|
|
||||||
#
|
|
||||||
# MODE=undef (default): write hedley_undef.hpp (SPDX header, #pragma once,
|
|
||||||
# one #undef per macro name) -- used by `make update_hedley_undef`
|
|
||||||
# MODE=checks: write one #ifdef/FAIL_CHECK/#endif per macro name,
|
|
||||||
# meant to be #include-d inside a TEST_CASE -- used by
|
|
||||||
# tests/CMakeLists.txt to (re)generate the include for
|
|
||||||
# tests/src/unit-no-macro-leak.cpp
|
|
||||||
#
|
|
||||||
# Required variables:
|
|
||||||
# HEDLEY_HPP path to include/nlohmann/thirdparty/hedley/hedley.hpp
|
|
||||||
# OUTPUT path of the file to (over)write
|
|
||||||
# Optional:
|
|
||||||
# MODE "undef" (default) or "checks"
|
|
||||||
|
|
||||||
if(NOT DEFINED HEDLEY_HPP OR NOT DEFINED OUTPUT)
|
|
||||||
message(FATAL_ERROR "HEDLEY_HPP and OUTPUT must be set")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
if(NOT EXISTS "${HEDLEY_HPP}")
|
|
||||||
message(FATAL_ERROR "Hedley header not found: ${HEDLEY_HPP}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
if(NOT DEFINED MODE)
|
|
||||||
set(MODE undef)
|
|
||||||
endif()
|
|
||||||
|
|
||||||
if(NOT MODE STREQUAL "undef" AND NOT MODE STREQUAL "checks")
|
|
||||||
message(FATAL_ERROR "MODE must be undef or checks, got: ${MODE}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
# Line-anchored, like `grep -oE "^[[:blank:]]*#[[:blank:]]*define[[:blank:]]+JSON_HEDLEY_[A-Za-z0-9_]+"`.
|
|
||||||
# Unanchored matching would also pick up JSON_HEDLEY_* mentions inside
|
|
||||||
# comments or string literals elsewhere in the file, which must not turn
|
|
||||||
# into #undef lines.
|
|
||||||
file(STRINGS "${HEDLEY_HPP}" hedley_lines)
|
|
||||||
set(macro_names)
|
|
||||||
foreach(line IN LISTS hedley_lines)
|
|
||||||
if("${line}" MATCHES "^[ \t]*#[ \t]*define[ \t]+(JSON_HEDLEY_[A-Za-z0-9_]+)")
|
|
||||||
list(APPEND macro_names "${CMAKE_MATCH_1}")
|
|
||||||
endif()
|
|
||||||
endforeach()
|
|
||||||
|
|
||||||
if(NOT macro_names)
|
|
||||||
message(FATAL_ERROR "No JSON_HEDLEY_* macros found in ${HEDLEY_HPP}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
list(REMOVE_DUPLICATES macro_names)
|
|
||||||
# Lexicographic, locale-independent (ASCII-only names) -- matches `LC_ALL=C sort`.
|
|
||||||
list(SORT macro_names COMPARE STRING)
|
|
||||||
list(LENGTH macro_names macro_count)
|
|
||||||
|
|
||||||
set(generated "")
|
|
||||||
if(MODE STREQUAL "undef")
|
|
||||||
# Same banner `make update_hedley_undef` would stamp by hand, so the
|
|
||||||
# recipe is self-contained and its output is byte-stable across reruns.
|
|
||||||
# The embedded SPDX tags below are part of the *generated* file's
|
|
||||||
# content, not a REUSE header for this .cmake script itself (which is
|
|
||||||
# already covered by the blanket "Files: *" rule in .reuse/dep5) -- keep
|
|
||||||
# them wrapped in REUSE-IgnoreStart/End so `reuse lint` does not try to
|
|
||||||
# parse "MIT\n")" as this file's own SPDX-License-Identifier value.
|
|
||||||
# REUSE-IgnoreStart
|
|
||||||
string(APPEND generated "// __ _____ _____ _____\n")
|
|
||||||
string(APPEND generated "// __| | __| | | | JSON for Modern C++\n")
|
|
||||||
string(APPEND generated "// | | |__ | | | | | | version 3.12.0\n")
|
|
||||||
string(APPEND generated "// |_____|_____|_____|_|___| https://github.com/nlohmann/json\n")
|
|
||||||
string(APPEND generated "//\n")
|
|
||||||
string(APPEND generated "// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>\n")
|
|
||||||
string(APPEND generated "// SPDX-License-Identifier: MIT\n")
|
|
||||||
# REUSE-IgnoreEnd
|
|
||||||
string(APPEND generated "\n")
|
|
||||||
string(APPEND generated "#pragma once\n")
|
|
||||||
string(APPEND generated "\n")
|
|
||||||
foreach(name IN LISTS macro_names)
|
|
||||||
string(APPEND generated "#undef ${name}\n")
|
|
||||||
endforeach()
|
|
||||||
else()
|
|
||||||
string(APPEND generated "// This file is generated by cmake/scripts/gen_hedley_undef_check.cmake\n")
|
|
||||||
string(APPEND generated "// from include/nlohmann/thirdparty/hedley/hedley.hpp. Do not edit it by\n")
|
|
||||||
string(APPEND generated "// hand -- it is regenerated on every build. ${macro_count} macros checked.\n\n")
|
|
||||||
foreach(name IN LISTS macro_names)
|
|
||||||
string(APPEND generated "#ifdef ${name}\n")
|
|
||||||
string(APPEND generated " FAIL_CHECK(\"${name} leaked after including nlohmann/json.hpp\");\n")
|
|
||||||
string(APPEND generated "#endif\n")
|
|
||||||
endforeach()
|
|
||||||
endif()
|
|
||||||
|
|
||||||
get_filename_component(output_dir "${OUTPUT}" DIRECTORY)
|
|
||||||
if(output_dir)
|
|
||||||
file(MAKE_DIRECTORY "${output_dir}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
# Avoid rewriting the file (and busting downstream incremental rebuilds)
|
|
||||||
# when the content has not actually changed.
|
|
||||||
set(write_output TRUE)
|
|
||||||
if(EXISTS "${OUTPUT}")
|
|
||||||
file(READ "${OUTPUT}" existing_content)
|
|
||||||
if(existing_content STREQUAL generated)
|
|
||||||
set(write_output FALSE)
|
|
||||||
endif()
|
|
||||||
endif()
|
|
||||||
if(write_output)
|
|
||||||
file(WRITE "${OUTPUT}" "${generated}")
|
|
||||||
endif()
|
|
||||||
+1
-4
@@ -17,7 +17,7 @@
|
|||||||
#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
|
#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
|
#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_FEATURE
|
#undef JSON_HEDLEY_CLANG_HAS_FEATURE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_WARNING
|
#undef JSON_HEDLEY_CLANG_HAS_WARNING
|
||||||
@@ -108,10 +108,7 @@
|
|||||||
#undef JSON_HEDLEY_PELLES_VERSION_CHECK
|
#undef JSON_HEDLEY_PELLES_VERSION_CHECK
|
||||||
#undef JSON_HEDLEY_PGI_VERSION
|
#undef JSON_HEDLEY_PGI_VERSION
|
||||||
#undef JSON_HEDLEY_PGI_VERSION_CHECK
|
#undef JSON_HEDLEY_PGI_VERSION_CHECK
|
||||||
#undef JSON_HEDLEY_PRAGMA
|
|
||||||
#undef JSON_HEDLEY_PREDICT
|
#undef JSON_HEDLEY_PREDICT
|
||||||
#undef JSON_HEDLEY_PREDICT_FALSE
|
|
||||||
#undef JSON_HEDLEY_PREDICT_TRUE
|
|
||||||
#undef JSON_HEDLEY_PRINTF_FORMAT
|
#undef JSON_HEDLEY_PRINTF_FORMAT
|
||||||
#undef JSON_HEDLEY_PRIVATE
|
#undef JSON_HEDLEY_PRIVATE
|
||||||
#undef JSON_HEDLEY_PUBLIC
|
#undef JSON_HEDLEY_PUBLIC
|
||||||
|
|||||||
@@ -26965,7 +26965,7 @@ struct formatter<nlohmann::NLOHMANN_BASIC_JSON_TPL, char> // NOLINT(cert-dcl58-c
|
|||||||
#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
|
#undef JSON_HEDLEY_CLANG_HAS_BUILTIN
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_CPP_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE
|
#undef JSON_HEDLEY_CLANG_HAS_DECLSPEC_DECLSPEC_ATTRIBUTE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
|
#undef JSON_HEDLEY_CLANG_HAS_EXTENSION
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_FEATURE
|
#undef JSON_HEDLEY_CLANG_HAS_FEATURE
|
||||||
#undef JSON_HEDLEY_CLANG_HAS_WARNING
|
#undef JSON_HEDLEY_CLANG_HAS_WARNING
|
||||||
@@ -27056,10 +27056,7 @@ struct formatter<nlohmann::NLOHMANN_BASIC_JSON_TPL, char> // NOLINT(cert-dcl58-c
|
|||||||
#undef JSON_HEDLEY_PELLES_VERSION_CHECK
|
#undef JSON_HEDLEY_PELLES_VERSION_CHECK
|
||||||
#undef JSON_HEDLEY_PGI_VERSION
|
#undef JSON_HEDLEY_PGI_VERSION
|
||||||
#undef JSON_HEDLEY_PGI_VERSION_CHECK
|
#undef JSON_HEDLEY_PGI_VERSION_CHECK
|
||||||
#undef JSON_HEDLEY_PRAGMA
|
|
||||||
#undef JSON_HEDLEY_PREDICT
|
#undef JSON_HEDLEY_PREDICT
|
||||||
#undef JSON_HEDLEY_PREDICT_FALSE
|
|
||||||
#undef JSON_HEDLEY_PREDICT_TRUE
|
|
||||||
#undef JSON_HEDLEY_PRINTF_FORMAT
|
#undef JSON_HEDLEY_PRINTF_FORMAT
|
||||||
#undef JSON_HEDLEY_PRIVATE
|
#undef JSON_HEDLEY_PRIVATE
|
||||||
#undef JSON_HEDLEY_PUBLIC
|
#undef JSON_HEDLEY_PUBLIC
|
||||||
|
|||||||
@@ -125,51 +125,6 @@ json_test_set_test_options(test-unicode4 TEST_PROPERTIES TIMEOUT 3000)
|
|||||||
# add unit tests
|
# add unit tests
|
||||||
#############################################################################
|
#############################################################################
|
||||||
|
|
||||||
# Generate the leak checks for every JSON_HEDLEY_* macro defined in
|
|
||||||
# hedley.hpp; tests/src/unit-no-macro-leak.cpp #include-s the result after
|
|
||||||
# nlohmann/json.hpp (see issue #5408). Using the shared
|
|
||||||
# cmake/scripts/gen_hedley_undef_check.cmake script (also used by `make
|
|
||||||
# update_hedley_undef`) instead of a hand-maintained list of macro names
|
|
||||||
# means this test can never go stale after a future `make update_hedley`.
|
|
||||||
set(hedley_hpp "${PROJECT_SOURCE_DIR}/include/nlohmann/thirdparty/hedley/hedley.hpp")
|
|
||||||
set(hedley_undef_check_script "${PROJECT_SOURCE_DIR}/cmake/scripts/gen_hedley_undef_check.cmake")
|
|
||||||
set(hedley_undef_checks "${PROJECT_BINARY_DIR}/include/hedley_undef_checks.inc")
|
|
||||||
|
|
||||||
# Reconfigure whenever the vendored header or the generator script changes,
|
|
||||||
# so a `cmake --build` after `make update_hedley` does not silently keep a
|
|
||||||
# stale generated file around.
|
|
||||||
set_property(DIRECTORY APPEND PROPERTY CMAKE_CONFIGURE_DEPENDS
|
|
||||||
"${hedley_hpp}"
|
|
||||||
"${hedley_undef_check_script}")
|
|
||||||
|
|
||||||
# Generate once at configure time, so the very first build (before any
|
|
||||||
# custom-command build step has run) already has an up-to-date file.
|
|
||||||
execute_process(
|
|
||||||
COMMAND ${CMAKE_COMMAND}
|
|
||||||
"-DHEDLEY_HPP=${hedley_hpp}"
|
|
||||||
"-DOUTPUT=${hedley_undef_checks}"
|
|
||||||
-DMODE=checks
|
|
||||||
-P "${hedley_undef_check_script}"
|
|
||||||
RESULT_VARIABLE hedley_undef_check_result
|
|
||||||
)
|
|
||||||
if(NOT hedley_undef_check_result EQUAL 0)
|
|
||||||
message(FATAL_ERROR "Failed to generate ${hedley_undef_checks}")
|
|
||||||
endif()
|
|
||||||
|
|
||||||
# Also (re)generate as a build step, so an incremental build after editing
|
|
||||||
# hedley.hpp without a full reconfigure still picks up the change.
|
|
||||||
add_custom_command(
|
|
||||||
OUTPUT "${hedley_undef_checks}"
|
|
||||||
COMMAND ${CMAKE_COMMAND}
|
|
||||||
"-DHEDLEY_HPP=${hedley_hpp}"
|
|
||||||
"-DOUTPUT=${hedley_undef_checks}"
|
|
||||||
-DMODE=checks
|
|
||||||
-P "${hedley_undef_check_script}"
|
|
||||||
DEPENDS "${hedley_hpp}" "${hedley_undef_check_script}"
|
|
||||||
COMMENT "Generating Hedley undef leak checks"
|
|
||||||
VERBATIM)
|
|
||||||
add_custom_target(generate_hedley_undef_checks DEPENDS "${hedley_undef_checks}")
|
|
||||||
|
|
||||||
if("${JSON_TestStandards}" STREQUAL "")
|
if("${JSON_TestStandards}" STREQUAL "")
|
||||||
set(test_cxx_standards 11 14 17 20 23)
|
set(test_cxx_standards 11 14 17 20 23)
|
||||||
unset(test_force)
|
unset(test_force)
|
||||||
@@ -208,14 +163,6 @@ foreach(file ${files})
|
|||||||
json_test_add_test_for(${file} MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force})
|
json_test_add_test_for(${file} MAIN test_main CXX_STANDARDS ${test_cxx_standards} ${test_force})
|
||||||
endforeach()
|
endforeach()
|
||||||
|
|
||||||
# tests/src/unit-no-macro-leak.cpp #include-s the generated leak-check file,
|
|
||||||
# so its test targets must be built after generate_hedley_undef_checks.
|
|
||||||
foreach(cxx_standard ${test_cxx_standards})
|
|
||||||
if(TARGET test-no-macro-leak_cpp${cxx_standard})
|
|
||||||
add_dependencies(test-no-macro-leak_cpp${cxx_standard} generate_hedley_undef_checks)
|
|
||||||
endif()
|
|
||||||
endforeach()
|
|
||||||
|
|
||||||
if(json_32bit_test_only)
|
if(json_32bit_test_only)
|
||||||
# Skip all other tests in this file
|
# Skip all other tests in this file
|
||||||
return()
|
return()
|
||||||
|
|||||||
@@ -1,34 +0,0 @@
|
|||||||
// __ _____ _____ _____
|
|
||||||
// __| | __| | | | JSON for Modern C++
|
|
||||||
// | | |__ | | | | | | version 3.12.0
|
|
||||||
// |_____|_____|_____|_|___| https://github.com/nlohmann/json
|
|
||||||
//
|
|
||||||
// SPDX-FileCopyrightText: 2013-2026 Niels Lohmann <https://nlohmann.me>
|
|
||||||
// SPDX-License-Identifier: MIT
|
|
||||||
|
|
||||||
// This file makes sure that none of the internal JSON_HEDLEY_* macros (vendored
|
|
||||||
// from https://nemequ.github.io/hedley/, see
|
|
||||||
// include/nlohmann/thirdparty/hedley/hedley.hpp) leak into the including
|
|
||||||
// translation unit. include/nlohmann/detail/macro_unscope.hpp is supposed to
|
|
||||||
// #undef every JSON_HEDLEY_* macro (via hedley_undef.hpp) once json.hpp has
|
|
||||||
// been fully processed. See https://github.com/nlohmann/json/issues/5408,
|
|
||||||
// where JSON_HEDLEY_PRAGMA, JSON_HEDLEY_PREDICT_TRUE, JSON_HEDLEY_PREDICT_FALSE,
|
|
||||||
// and JSON_HEDLEY_CLANG_HAS_DECLSPEC_ATTRIBUTE escaped this cleanup because
|
|
||||||
// hedley_undef.hpp had no matching #undef for them.
|
|
||||||
//
|
|
||||||
// hedley_undef_checks.inc (included below) is generated at CMake configure/
|
|
||||||
// build time by cmake/scripts/gen_hedley_undef_check.cmake, which derives the
|
|
||||||
// full list of JSON_HEDLEY_* macro names directly from hedley.hpp. That way
|
|
||||||
// this test covers every macro Hedley actually defines -- not a hardcoded
|
|
||||||
// snapshot that would silently go stale the next time `make update_hedley`
|
|
||||||
// runs -- and can never drift from the vendored header.
|
|
||||||
|
|
||||||
#include "doctest_compatibility.h"
|
|
||||||
|
|
||||||
#include <nlohmann/json.hpp>
|
|
||||||
|
|
||||||
TEST_CASE("JSON_HEDLEY macros do not leak after including json.hpp")
|
|
||||||
{
|
|
||||||
#include "hedley_undef_checks.inc"
|
|
||||||
CHECK(true); // keep an assertion when nothing leaked
|
|
||||||
}
|
|
||||||
@@ -0,0 +1,489 @@
|
|||||||
|
// __ _____ _____ _____
|
||||||
|
// __| | __| | | | 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-FileCopyrightText: 2018 Vitaliy Manushkin <agri@akamo.info>
|
||||||
|
// SPDX-License-Identifier: MIT
|
||||||
|
|
||||||
|
// This file closes a test-coverage gap described in GitHub issue #5421:
|
||||||
|
// nlohmann::ordered_json (and other non-default basic_json specializations,
|
||||||
|
// such as the alt_string-based one from unit-alt-string.cpp) were never
|
||||||
|
// exercised through the binary formats (CBOR/MessagePack/UBJSON/BSON/BJData)
|
||||||
|
// or through flatten()/unflatten()/diff()/patch()/merge_patch().
|
||||||
|
|
||||||
|
#include "doctest_compatibility.h"
|
||||||
|
|
||||||
|
#include <nlohmann/json.hpp>
|
||||||
|
|
||||||
|
#include <cstdint>
|
||||||
|
#include <string>
|
||||||
|
#include <utility>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
using nlohmann::json;
|
||||||
|
using nlohmann::ordered_json;
|
||||||
|
|
||||||
|
/////////////////////////////////////////////////////////////////////////////
|
||||||
|
// alt_json: a second, independent copy of the custom-string_t basic_json
|
||||||
|
// specialization defined in unit-alt-string.cpp.
|
||||||
|
//
|
||||||
|
// It is duplicated here (rather than shared via a header) because every
|
||||||
|
// unit-*.cpp file in this test suite is compiled into its own standalone
|
||||||
|
// executable (see tests/CMakeLists.txt), so there is no ODR concern in
|
||||||
|
// having the same class name defined in multiple translation units.
|
||||||
|
//
|
||||||
|
// Two members had to be added relative to the original alt_string
|
||||||
|
// (a constructor from std::string, and a find(char, pos) overload) because
|
||||||
|
// the original type was never used with the binary writers/readers before
|
||||||
|
// this file: BSON's array/document writer converts std::to_string() results
|
||||||
|
// and checks for embedded NUL characters via find(char), and the UBJSON/BSON
|
||||||
|
// high-precision-number path constructs the SAX string_t argument from a
|
||||||
|
// std::string. Neither path is exercised anywhere else in the test suite for
|
||||||
|
// this type, which is presumably why the gap was never noticed.
|
||||||
|
/////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
class alt_string;
|
||||||
|
bool operator<(const char* op1, const alt_string& op2) noexcept; // NOLINT(misc-use-internal-linkage)
|
||||||
|
void int_to_string(alt_string& target, std::size_t value); // NOLINT(misc-use-internal-linkage)
|
||||||
|
|
||||||
|
class alt_string
|
||||||
|
{
|
||||||
|
public:
|
||||||
|
using value_type = std::string::value_type;
|
||||||
|
|
||||||
|
static constexpr auto npos = (std::numeric_limits<std::size_t>::max)();
|
||||||
|
|
||||||
|
alt_string(const char* str): str_impl(str) {}
|
||||||
|
alt_string(const char* str, std::size_t count): str_impl(str, count) {}
|
||||||
|
alt_string(std::string str): str_impl(std::move(str)) {}
|
||||||
|
alt_string(size_t count, char chr): str_impl(count, chr) {}
|
||||||
|
alt_string() = default;
|
||||||
|
|
||||||
|
alt_string& append(char ch)
|
||||||
|
{
|
||||||
|
str_impl.push_back(ch);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
alt_string& append(const alt_string& str)
|
||||||
|
{
|
||||||
|
str_impl.append(str.str_impl);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
alt_string& append(const char* s, std::size_t length)
|
||||||
|
{
|
||||||
|
str_impl.append(s, length);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void push_back(char c)
|
||||||
|
{
|
||||||
|
str_impl.push_back(c);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename op_type>
|
||||||
|
bool operator==(const op_type& op) const
|
||||||
|
{
|
||||||
|
return str_impl == op;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool operator==(const alt_string& op) const
|
||||||
|
{
|
||||||
|
return str_impl == op.str_impl;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename op_type>
|
||||||
|
bool operator!=(const op_type& op) const
|
||||||
|
{
|
||||||
|
return str_impl != op;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool operator!=(const alt_string& op) const
|
||||||
|
{
|
||||||
|
return str_impl != op.str_impl;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::size_t size() const noexcept
|
||||||
|
{
|
||||||
|
return str_impl.size();
|
||||||
|
}
|
||||||
|
|
||||||
|
void resize(std::size_t n)
|
||||||
|
{
|
||||||
|
str_impl.resize(n);
|
||||||
|
}
|
||||||
|
|
||||||
|
void resize(std::size_t n, char c)
|
||||||
|
{
|
||||||
|
str_impl.resize(n, c);
|
||||||
|
}
|
||||||
|
|
||||||
|
template <typename op_type>
|
||||||
|
bool operator<(const op_type& op) const noexcept
|
||||||
|
{
|
||||||
|
return str_impl < op;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool operator<(const alt_string& op) const noexcept
|
||||||
|
{
|
||||||
|
return str_impl < op.str_impl;
|
||||||
|
}
|
||||||
|
|
||||||
|
const char* c_str() const
|
||||||
|
{
|
||||||
|
return str_impl.c_str();
|
||||||
|
}
|
||||||
|
|
||||||
|
char& operator[](std::size_t index)
|
||||||
|
{
|
||||||
|
return str_impl[index];
|
||||||
|
}
|
||||||
|
|
||||||
|
const char& operator[](std::size_t index) const
|
||||||
|
{
|
||||||
|
return str_impl[index];
|
||||||
|
}
|
||||||
|
|
||||||
|
char& back()
|
||||||
|
{
|
||||||
|
return str_impl.back();
|
||||||
|
}
|
||||||
|
|
||||||
|
const char& back() const
|
||||||
|
{
|
||||||
|
return str_impl.back();
|
||||||
|
}
|
||||||
|
|
||||||
|
void clear()
|
||||||
|
{
|
||||||
|
str_impl.clear();
|
||||||
|
}
|
||||||
|
|
||||||
|
const value_type* data() const
|
||||||
|
{
|
||||||
|
return str_impl.data();
|
||||||
|
}
|
||||||
|
|
||||||
|
bool empty() const
|
||||||
|
{
|
||||||
|
return str_impl.empty();
|
||||||
|
}
|
||||||
|
|
||||||
|
std::size_t find(const alt_string& str, std::size_t pos = 0) const
|
||||||
|
{
|
||||||
|
return str_impl.find(str.str_impl, pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
// needed by binary_writer's BSON support, which probes string keys for
|
||||||
|
// embedded NUL characters via find(char)
|
||||||
|
std::size_t find(char c, std::size_t pos = 0) const
|
||||||
|
{
|
||||||
|
return str_impl.find(c, pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::size_t find_first_of(char c, std::size_t pos = 0) const
|
||||||
|
{
|
||||||
|
return str_impl.find_first_of(c, pos);
|
||||||
|
}
|
||||||
|
|
||||||
|
alt_string substr(std::size_t pos = 0, std::size_t count = npos) const
|
||||||
|
{
|
||||||
|
const std::string s = str_impl.substr(pos, count);
|
||||||
|
return {s.data(), s.size()};
|
||||||
|
}
|
||||||
|
|
||||||
|
alt_string& replace(std::size_t pos, std::size_t count, const alt_string& str)
|
||||||
|
{
|
||||||
|
str_impl.replace(pos, count, str.str_impl);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void reserve(std::size_t new_cap = 0)
|
||||||
|
{
|
||||||
|
str_impl.reserve(new_cap);
|
||||||
|
}
|
||||||
|
|
||||||
|
private:
|
||||||
|
std::string str_impl {}; // NOLINT(readability-redundant-member-init)
|
||||||
|
|
||||||
|
friend bool operator<(const char* /*op1*/, const alt_string& /*op2*/) noexcept;
|
||||||
|
};
|
||||||
|
|
||||||
|
void int_to_string(alt_string& target, std::size_t value)
|
||||||
|
{
|
||||||
|
target = std::to_string(value).c_str();
|
||||||
|
}
|
||||||
|
|
||||||
|
using alt_json = nlohmann::basic_json <
|
||||||
|
std::map,
|
||||||
|
std::vector,
|
||||||
|
alt_string,
|
||||||
|
bool,
|
||||||
|
std::int64_t,
|
||||||
|
std::uint64_t,
|
||||||
|
double,
|
||||||
|
std::allocator,
|
||||||
|
nlohmann::adl_serializer >;
|
||||||
|
|
||||||
|
bool operator<(const char* op1, const alt_string& op2) noexcept
|
||||||
|
{
|
||||||
|
return op1 < op2.str_impl;
|
||||||
|
}
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
|
||||||
|
// collects the object keys of j, in iteration order
|
||||||
|
std::vector<std::string> collect_keys(const ordered_json& j)
|
||||||
|
{
|
||||||
|
std::vector<std::string> result;
|
||||||
|
for (auto it = j.cbegin(); it != j.cend(); ++it)
|
||||||
|
{
|
||||||
|
result.push_back(it.key());
|
||||||
|
}
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
// a nested object/array value with keys inserted in non-alphabetical order,
|
||||||
|
// used to check both round-trip equality and (for ordered_json) that
|
||||||
|
// insertion order survives a trip through a binary format
|
||||||
|
ordered_json make_rich_ordered_json()
|
||||||
|
{
|
||||||
|
ordered_json j;
|
||||||
|
j["zebra"] = 1;
|
||||||
|
j["apple"] = ordered_json::array({1, 2, 3});
|
||||||
|
j["mango"]["z_nested"] = true;
|
||||||
|
j["mango"]["a_nested"] = nullptr;
|
||||||
|
j["banana"] = "some text";
|
||||||
|
j["cherry"] = 3.14;
|
||||||
|
return j;
|
||||||
|
}
|
||||||
|
|
||||||
|
alt_json make_rich_alt_json()
|
||||||
|
{
|
||||||
|
alt_json j;
|
||||||
|
j["zebra"] = 1;
|
||||||
|
j["apple"] = alt_json::array({1, 2, 3});
|
||||||
|
j["mango"]["z_nested"] = true;
|
||||||
|
j["mango"]["a_nested"] = nullptr;
|
||||||
|
j["banana"] = "some text";
|
||||||
|
j["cherry"] = 3.14;
|
||||||
|
return j;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace
|
||||||
|
|
||||||
|
TEST_CASE("ordered_json across binary formats")
|
||||||
|
{
|
||||||
|
const ordered_json original = make_rich_ordered_json();
|
||||||
|
const std::vector<std::string> original_keys = collect_keys(original);
|
||||||
|
const std::vector<std::string> original_mango_keys = collect_keys(original["mango"]);
|
||||||
|
|
||||||
|
SECTION("CBOR")
|
||||||
|
{
|
||||||
|
const auto bytes = ordered_json::to_cbor(original);
|
||||||
|
const auto restored = ordered_json::from_cbor(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
CHECK(collect_keys(restored) == original_keys);
|
||||||
|
CHECK(collect_keys(restored["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("MessagePack")
|
||||||
|
{
|
||||||
|
const auto bytes = ordered_json::to_msgpack(original);
|
||||||
|
const auto restored = ordered_json::from_msgpack(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
CHECK(collect_keys(restored) == original_keys);
|
||||||
|
CHECK(collect_keys(restored["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("UBJSON")
|
||||||
|
{
|
||||||
|
const auto bytes = ordered_json::to_ubjson(original);
|
||||||
|
const auto restored = ordered_json::from_ubjson(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
CHECK(collect_keys(restored) == original_keys);
|
||||||
|
CHECK(collect_keys(restored["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("BSON")
|
||||||
|
{
|
||||||
|
const auto bytes = ordered_json::to_bson(original);
|
||||||
|
const auto restored = ordered_json::from_bson(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
CHECK(collect_keys(restored) == original_keys);
|
||||||
|
CHECK(collect_keys(restored["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("BJData")
|
||||||
|
{
|
||||||
|
const auto bytes = ordered_json::to_bjdata(original);
|
||||||
|
const auto restored = ordered_json::from_bjdata(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
CHECK(collect_keys(restored) == original_keys);
|
||||||
|
CHECK(collect_keys(restored["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("alt_json (custom string_t) across binary formats")
|
||||||
|
{
|
||||||
|
const alt_json original = make_rich_alt_json();
|
||||||
|
|
||||||
|
SECTION("CBOR")
|
||||||
|
{
|
||||||
|
const auto bytes = alt_json::to_cbor(original);
|
||||||
|
const auto restored = alt_json::from_cbor(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("MessagePack")
|
||||||
|
{
|
||||||
|
const auto bytes = alt_json::to_msgpack(original);
|
||||||
|
const auto restored = alt_json::from_msgpack(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("UBJSON")
|
||||||
|
{
|
||||||
|
const auto bytes = alt_json::to_ubjson(original);
|
||||||
|
const auto restored = alt_json::from_ubjson(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("BSON")
|
||||||
|
{
|
||||||
|
const auto bytes = alt_json::to_bson(original);
|
||||||
|
const auto restored = alt_json::from_bson(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("BJData")
|
||||||
|
{
|
||||||
|
const auto bytes = alt_json::to_bjdata(original);
|
||||||
|
const auto restored = alt_json::from_bjdata(bytes);
|
||||||
|
CHECK(restored == original);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("ordered_json operator== is sensitive to key order")
|
||||||
|
{
|
||||||
|
// Unlike nlohmann::json (whose object_t is a std::map, so equality never
|
||||||
|
// depends on insertion order), ordered_json's object_t (ordered_map) is a
|
||||||
|
// std::vector<std::pair<Key, T>> under the hood, and does not define its
|
||||||
|
// own operator==: it inherits std::vector's element-wise comparison. As a
|
||||||
|
// result, two ordered_json objects holding the very same key/value pairs
|
||||||
|
// in different insertion order compare *unequal*. This is the property
|
||||||
|
// that makes the round-trip `CHECK(restored == original)` checks above a
|
||||||
|
// meaningful order-preservation check by themselves (the explicit
|
||||||
|
// collect_keys() comparisons make that check explicit/readable, and
|
||||||
|
// guard against this operator== behavior ever changing).
|
||||||
|
ordered_json a;
|
||||||
|
a["x"] = 1;
|
||||||
|
a["y"] = 2;
|
||||||
|
|
||||||
|
ordered_json b;
|
||||||
|
b["y"] = 2;
|
||||||
|
b["x"] = 1;
|
||||||
|
|
||||||
|
CHECK(a.size() == b.size());
|
||||||
|
CHECK(a["x"] == b["x"]);
|
||||||
|
CHECK(a["y"] == b["y"]);
|
||||||
|
CHECK_FALSE(a == b);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("duplicate keys in a binary-encoded object")
|
||||||
|
{
|
||||||
|
// CBOR encoding of a map with two entries under the same key "a": {"a": 1, "a": 2}
|
||||||
|
const std::vector<std::uint8_t> cbor_bytes
|
||||||
|
{
|
||||||
|
0xA2, 0x61, 'a', 0x01, 0x61, 'a', 0x02
|
||||||
|
};
|
||||||
|
|
||||||
|
// Both json (std::map, via operator[]) and ordered_json (ordered_map, via
|
||||||
|
// operator[]) build binary-decoded objects by looking up/creating the
|
||||||
|
// entry for each incoming key and then assigning the value into it. This
|
||||||
|
// means a repeated key does *not* produce two entries in either case;
|
||||||
|
// instead, the *first* occurrence's position is kept (relevant only for
|
||||||
|
// ordered_json) while the *last* occurrence's value wins (for both) --
|
||||||
|
// this matches operator[]'s "assign the referenced slot" semantics, and
|
||||||
|
// is worth noting because it differs from the initializer-list
|
||||||
|
// construction path (`ordered_json{{"a",1},{"a",2}}`), which builds
|
||||||
|
// through insert()/emplace() and therefore keeps the *first* value, not
|
||||||
|
// the last (see the "There are no dup keys..." case in
|
||||||
|
// unit-ordered_json.cpp).
|
||||||
|
const auto j = json::from_cbor(cbor_bytes);
|
||||||
|
const auto oj = ordered_json::from_cbor(cbor_bytes);
|
||||||
|
|
||||||
|
CHECK(j.size() == 1);
|
||||||
|
CHECK(oj.size() == 1);
|
||||||
|
CHECK(j["a"] == 2);
|
||||||
|
CHECK(oj["a"] == 2);
|
||||||
|
CHECK(j == json(oj));
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("ordered_json through flatten/unflatten")
|
||||||
|
{
|
||||||
|
const ordered_json original = make_rich_ordered_json();
|
||||||
|
const std::vector<std::string> original_keys = collect_keys(original);
|
||||||
|
const std::vector<std::string> original_mango_keys = collect_keys(original["mango"]);
|
||||||
|
|
||||||
|
const ordered_json flat = original.flatten();
|
||||||
|
const ordered_json unflattened = flat.unflatten();
|
||||||
|
|
||||||
|
CHECK(unflattened == original);
|
||||||
|
// flatten() walks the value depth-first in iteration order and
|
||||||
|
// unflatten() re-inserts each flattened key via operator[] in the flat
|
||||||
|
// object's iteration order, so for ordered_json the original key order
|
||||||
|
// (both top-level and nested) is preserved end-to-end.
|
||||||
|
CHECK(collect_keys(unflattened) == original_keys);
|
||||||
|
CHECK(collect_keys(unflattened["mango"]) == original_mango_keys);
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("ordered_json through diff/patch/patch_inplace")
|
||||||
|
{
|
||||||
|
ordered_json original;
|
||||||
|
original["one"] = 1;
|
||||||
|
original["two"] = 2;
|
||||||
|
original["three"] = 3;
|
||||||
|
|
||||||
|
ordered_json target = original;
|
||||||
|
target["one"] = 100; // replace
|
||||||
|
target.erase("two"); // remove
|
||||||
|
target["four"] = 4; // add
|
||||||
|
|
||||||
|
const ordered_json patch = ordered_json::diff(original, target);
|
||||||
|
|
||||||
|
SECTION("patch")
|
||||||
|
{
|
||||||
|
const ordered_json patched = original.patch(patch);
|
||||||
|
CHECK(patched == target);
|
||||||
|
}
|
||||||
|
|
||||||
|
SECTION("patch_inplace")
|
||||||
|
{
|
||||||
|
ordered_json copy = original;
|
||||||
|
copy.patch_inplace(patch);
|
||||||
|
CHECK(copy == target);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
TEST_CASE("ordered_json through merge_patch")
|
||||||
|
{
|
||||||
|
ordered_json original;
|
||||||
|
original["a"] = 1;
|
||||||
|
original["b"] = 2;
|
||||||
|
|
||||||
|
const ordered_json patch = {{"b", nullptr}, {"c", 3}};
|
||||||
|
|
||||||
|
original.merge_patch(patch);
|
||||||
|
|
||||||
|
ordered_json expected;
|
||||||
|
expected["a"] = 1;
|
||||||
|
expected["c"] = 3;
|
||||||
|
|
||||||
|
CHECK(original == expected);
|
||||||
|
CHECK(collect_keys(original) == collect_keys(expected));
|
||||||
|
}
|
||||||
@@ -17,6 +17,7 @@
|
|||||||
|
|
||||||
#include <nlohmann/json.hpp>
|
#include <nlohmann/json.hpp>
|
||||||
using json = nlohmann::json;
|
using json = nlohmann::json;
|
||||||
|
using ordered_json = nlohmann::ordered_json;
|
||||||
|
|
||||||
// JSON_HAS_CPP_20 (do not remove; see note at top of file)
|
// JSON_HAS_CPP_20 (do not remove; see note at top of file)
|
||||||
#if JSON_HAS_STD_FORMAT
|
#if JSON_HAS_STD_FORMAT
|
||||||
@@ -93,4 +94,16 @@ TEST_CASE("std::formatter<nlohmann::json>")
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
TEST_CASE("std::formatter<nlohmann::ordered_json>")
|
||||||
|
{
|
||||||
|
// spot-check a non-default basic_json instantiation, since the formatter
|
||||||
|
// is written against the generic NLOHMANN_BASIC_JSON_TPL_DECLARATION
|
||||||
|
// template and must actually instantiate (and behave correctly) for
|
||||||
|
// template arguments other than nlohmann::json
|
||||||
|
const ordered_json j = {{"foo", 1}, {"bar", {1, 2, 3}}};
|
||||||
|
CHECK(std::format("{}", j) == j.dump());
|
||||||
|
CHECK(std::format("{:#}", j) == j.dump(4));
|
||||||
|
CHECK(std::format("{:2}", j) == j.dump(2));
|
||||||
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|||||||
Reference in New Issue
Block a user