From a1284028b26d182a89393107825071f6ed7629c7 Mon Sep 17 00:00:00 2001
From: Niels Lohmann
Date: Wed, 18 Nov 2026 08:50:36 +0100
Subject: [PATCH 01/14] json_view: fix a scalar set() through a view of an
erased value (#6132)
Signed-off-by: Niels Lohmann
---
.../docs/api/basic_json_document/index.md | 3 +-
.../docs/api/basic_json_document/set.md | 4 +-
include/nlohmann/detail/view/edit.hpp | 17 ++++-
include/nlohmann/detail/view/edit_storage.hpp | 39 ++++++++++-
single_include/nlohmann/json_view.hpp | 56 ++++++++++++++-
tests/src/unit-json_view_edit.cpp | 70 +++++++++++++++++++
6 files changed, 181 insertions(+), 8 deletions(-)
diff --git a/docs/mkdocs/docs/api/basic_json_document/index.md b/docs/mkdocs/docs/api/basic_json_document/index.md
index 3d7f41aad..c31857bb3 100644
--- a/docs/mkdocs/docs/api/basic_json_document/index.md
+++ b/docs/mkdocs/docs/api/basic_json_document/index.md
@@ -100,7 +100,8 @@ points apply to every edit:
[`root()`](root.md). New values (and the element sequences of an edited array/object) go to storage owned by the
document, allocated on demand.
- **A view keeps referring to the same value.** After [`set`](set.md) replaces the value a view refers to, that view
- sees the new value; a view of a value that a later edit replaces or drops keeps showing what it last held. An edit
+ sees the new value; a view of a value that a later edit replaces or drops keeps showing what it last held. Such a
+ view can still be edited: the edit changes only that detached value, never anything reachable from `root()`. An edit
of an array or object, however, **invalidates the iterators taken over it** (its members may now live in a
different sequence), and a string obtained with [`get_string()`](../basic_json_view/get_string.md) stays valid even
as further edits happen (earlier buffers of edited text are kept alive, not overwritten).
diff --git a/docs/mkdocs/docs/api/basic_json_document/set.md b/docs/mkdocs/docs/api/basic_json_document/set.md
index 5c68da311..a983a4055 100644
--- a/docs/mkdocs/docs/api/basic_json_document/set.md
+++ b/docs/mkdocs/docs/api/basic_json_document/set.md
@@ -164,7 +164,9 @@ general.
The same switch happens, for the same reason, when overload 1. replaces a multi-node array/object value with a
scalar: the *parent's* element sequence is what has to switch to links, not `target` itself, because the parent
originally stepped over `target`'s whole subtree by its node count, which no longer applies once `target` is a
-one-node scalar.
+one-node scalar. This also holds when `target` is no longer part of the document (an edit erased or replaced it, or
+a value that contains it): if the container that `target` was in still uses its parsed layout, it switches to links
+(otherwise nothing steps over `target` any more), and only the dropped values change.
## Examples
diff --git a/include/nlohmann/detail/view/edit.hpp b/include/nlohmann/detail/view/edit.hpp
index 8ddf3f849..af213e9fd 100644
--- a/include/nlohmann/detail/view/edit.hpp
+++ b/include/nlohmann/detail/view/edit.hpp
@@ -384,9 +384,22 @@ class editor
// for the container is linear in the size of the document, so
// links (which are marked in the slot) avoid it.
node* const p = parent_known ? parent : find_parent(m_doc, slot);
- if (p != nullptr && ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0))
+ if (p != nullptr)
{
- block_of(m_doc, p, 0);
+ if ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0)
+ {
+ block_of(m_doc, p, 0);
+ }
+ }
+ else
+ {
+ // the slot is no longer part of the document, but the
+ // (dropped) container it is in may still step over it
+ node* const q = find_layout_parent(m_doc, slot);
+ if (q != nullptr)
+ {
+ block_of(m_doc, q, 0);
+ }
}
}
*slot = e.scalar;
diff --git a/include/nlohmann/detail/view/edit_storage.hpp b/include/nlohmann/detail/view/edit_storage.hpp
index 34b804c46..d9c0339a7 100644
--- a/include/nlohmann/detail/view/edit_storage.hpp
+++ b/include/nlohmann/detail/view/edit_storage.hpp
@@ -194,7 +194,9 @@ inline node* block_of(document_data& d, node* n, std::size_t extra)
h->len = n->len;
h->next = static_cast(used);
node* o = h + 1;
- for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n); c != e;)
+ // (the bound on o keeps the copy inside the block even if the elements
+ // disagreed with the element count)
+ for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n), *const full = h + used; c != e && o != full;)
{
if (object)
{
@@ -276,6 +278,41 @@ inline node* find_parent(const document_data& d, const node* target)
}
}
+/// The container whose contiguous layout (in the parsed index, or in a new
+/// value) steps over `target`, also when an edit dropped the container or a
+/// value that encloses it; nullptr if there is none, or if the container no
+/// longer walks that layout (its elements moved). An edit never gives a node a
+/// larger extent than it was parsed or encoded with (a scalar is one node, an
+/// assigned array/object keeps the extent of the slot), so the containers whose
+/// extent covers `target` are its original ancestors: the nearest one before it
+/// is its original parent. The root of a new value that is the element sequence
+/// of another container is walked by that container (which find_parent() finds
+/// while it still uses the sequence), not by itself.
+inline node* find_layout_parent(const document_data& d, const node* target)
+{
+ const std::less lt{};
+ const node* lo = d.nodes;
+ if (lt(target, lo) || !lt(target, d.nodes + d.node_count))
+ {
+ auto it = d.edits->regions.upper_bound(target);
+ if (it == d.edits->regions.begin())
+ {
+ return nullptr; // LCOV_EXCL_LINE (an array/object with elements is in the index or a new value)
+ }
+ --it;
+ lo = it->second != nullptr ? it->first + 1 : it->first;
+ }
+ for (const node* c = target; c != lo;)
+ {
+ --c;
+ if (is_container(*c) && lt(target, c + c->next))
+ {
+ return (c->flags & node_flags::moved) == 0 ? const_cast(c) : nullptr; // NOLINT(cppcoreguidelines-pro-type-const-cast): the nodes belong to the document
+ }
+ }
+ return nullptr;
+}
+
} // namespace view
} // namespace detail
NLOHMANN_JSON_NAMESPACE_END
diff --git a/single_include/nlohmann/json_view.hpp b/single_include/nlohmann/json_view.hpp
index 233a55487..b23199021 100644
--- a/single_include/nlohmann/json_view.hpp
+++ b/single_include/nlohmann/json_view.hpp
@@ -5564,7 +5564,9 @@ inline node* block_of(document_data& d, node* n, std::size_t extra)
h->len = n->len;
h->next = static_cast(used);
node* o = h + 1;
- for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n); c != e;)
+ // (the bound on o keeps the copy inside the block even if the elements
+ // disagreed with the element count)
+ for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n), *const full = h + used; c != e && o != full;)
{
if (object)
{
@@ -5646,6 +5648,41 @@ inline node* find_parent(const document_data& d, const node* target)
}
}
+/// The container whose contiguous layout (in the parsed index, or in a new
+/// value) steps over `target`, also when an edit dropped the container or a
+/// value that encloses it; nullptr if there is none, or if the container no
+/// longer walks that layout (its elements moved). An edit never gives a node a
+/// larger extent than it was parsed or encoded with (a scalar is one node, an
+/// assigned array/object keeps the extent of the slot), so the containers whose
+/// extent covers `target` are its original ancestors: the nearest one before it
+/// is its original parent. The root of a new value that is the element sequence
+/// of another container is walked by that container (which find_parent() finds
+/// while it still uses the sequence), not by itself.
+inline node* find_layout_parent(const document_data& d, const node* target)
+{
+ const std::less lt{};
+ const node* lo = d.nodes;
+ if (lt(target, lo) || !lt(target, d.nodes + d.node_count))
+ {
+ auto it = d.edits->regions.upper_bound(target);
+ if (it == d.edits->regions.begin())
+ {
+ return nullptr; // LCOV_EXCL_LINE (an array/object with elements is in the index or a new value)
+ }
+ --it;
+ lo = it->second != nullptr ? it->first + 1 : it->first;
+ }
+ for (const node* c = target; c != lo;)
+ {
+ --c;
+ if (is_container(*c) && lt(target, c + c->next))
+ {
+ return (c->flags & node_flags::moved) == 0 ? const_cast(c) : nullptr; // NOLINT(cppcoreguidelines-pro-type-const-cast): the nodes belong to the document
+ }
+ }
+ return nullptr;
+}
+
} // namespace view
} // namespace detail
NLOHMANN_JSON_NAMESPACE_END
@@ -6522,9 +6559,22 @@ class editor
// for the container is linear in the size of the document, so
// links (which are marked in the slot) avoid it.
node* const p = parent_known ? parent : find_parent(m_doc, slot);
- if (p != nullptr && ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0))
+ if (p != nullptr)
{
- block_of(m_doc, p, 0);
+ if ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0)
+ {
+ block_of(m_doc, p, 0);
+ }
+ }
+ else
+ {
+ // the slot is no longer part of the document, but the
+ // (dropped) container it is in may still step over it
+ node* const q = find_layout_parent(m_doc, slot);
+ if (q != nullptr)
+ {
+ block_of(m_doc, q, 0);
+ }
}
}
*slot = e.scalar;
diff --git a/tests/src/unit-json_view_edit.cpp b/tests/src/unit-json_view_edit.cpp
index db6d3054b..94b4df706 100644
--- a/tests/src/unit-json_view_edit.cpp
+++ b/tests/src/unit-json_view_edit.cpp
@@ -589,6 +589,76 @@ TEST_CASE("json_view edits: a container that was added is replaced by a scalar")
CHECK(d.root().materialize() == json::parse(R"({"a":[1,6,{"k":"s"}]})"));
}
+TEST_CASE("json_view edits: a scalar replaces an array or object that is no longer part of the document")
+{
+ // the dropped container that the array/object is in still steps over its
+ // parsed extent: that container switches to links first, as a live one does
+ SECTION("members of an erased object")
+ {
+ json_editable_document d = json_editable_document::parse(R"({"p": {"a": [1, [2]], "b": 3, "e": []}, "q": 0})");
+ const json_editable_view p = d.root()["p"];
+ const json_editable_view a = p["a"];
+ d.erase(d.root(), "p");
+ d.set(a[1], 5);
+ CHECK(p.dump() == R"({"a":[1,5],"b":3,"e":[]})");
+ d.set(a, 5);
+ CHECK(p.size() == 3);
+ CHECK(p.dump() == R"({"a":5,"b":3,"e":[]})");
+ d.push_back(p["e"], 6);
+ CHECK(p.dump() == R"({"a":5,"b":3,"e":[6]})");
+ CHECK(d.root().dump() == R"({"q":0})");
+ }
+
+ SECTION("an array whose elements moved")
+ {
+ json_editable_document d = json_editable_document::parse(R"({"p": {"a": [1, 2], "b": 3}, "q": 0})");
+ const json_editable_view p = d.root()["p"];
+ const json_editable_view a = p["a"];
+ d.erase(d.root(), "p");
+ d.push_back(a, 4); // (the extent of a stays)
+ d.set(a, 5);
+ CHECK(p.dump() == R"({"a":5,"b":3})");
+ CHECK(d.root().dump() == R"({"q":0})");
+ }
+
+ SECTION("an element of an erased array, which grows afterwards")
+ {
+ json_editable_document d = json_editable_document::parse(R"({"p": [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], "q": 0})");
+ const json_editable_view p = d.root()["p"];
+ d.erase(d.root(), "p");
+ d.set(p[0], 5);
+ d.push_back(p, 1);
+ CHECK(p.dump() == "[5,1]");
+ CHECK(d.root().dump() == R"({"q":0})");
+ }
+
+ SECTION("values in an erased new value")
+ {
+ json_editable_document d = json_editable_document::parse("[0]");
+ const json_editable_view x = d.push_back(d.root(), json::parse("[[[1, 2]], 3]"));
+ const json_editable_view y = x[0];
+ d.erase(d.root(), 1);
+ d.set(y[0], 5);
+ CHECK(x.dump() == "[[5],3]");
+ d.set(y, 5);
+ CHECK(x.dump() == "[5,3]");
+ CHECK(d.root().dump() == "[0]");
+ }
+
+ SECTION("values in the elements that an array had before it was replaced")
+ {
+ json_editable_document d = json_editable_document::parse("[0]");
+ d.set(d.root()[0], json::parse("[[[1, 2]]]"));
+ const json_editable_view y = d.root()[0][0];
+ d.set(d.root()[0], json::array({3}));
+ d.set(y[0], 5);
+ CHECK(y.dump() == "[5]");
+ d.set(y, 5);
+ CHECK(y.dump() == "5");
+ CHECK(d.root().dump() == "[[3]]");
+ }
+}
+
#if !defined(JSON_NOEXCEPTION)
TEST_CASE("json_view edits: the size of a text arena")
{
From 03ce377876aa421d176ed1913744092558874add Mon Sep 17 00:00:00 2001
From: Niels Lohmann
Date: Wed, 18 Nov 2026 08:51:42 +0100
Subject: [PATCH 02/14] Pass the complete text of a UBJSON/BJData
high-precision number to SAX number_float (#6134)
Signed-off-by: Niels Lohmann
---
.../nlohmann/detail/input/binary_reader.hpp | 9 +++++----
single_include/nlohmann/json.hpp | 9 +++++----
tests/src/unit-bjdata.cpp | 19 +++++++++++++++++++
tests/src/unit-ubjson.cpp | 19 +++++++++++++++++++
4 files changed, 48 insertions(+), 8 deletions(-)
diff --git a/include/nlohmann/detail/input/binary_reader.hpp b/include/nlohmann/detail/input/binary_reader.hpp
index bbd2daceb..c7b1b92f8 100644
--- a/include/nlohmann/detail/input/binary_reader.hpp
+++ b/include/nlohmann/detail/input/binary_reader.hpp
@@ -4096,6 +4096,10 @@ class binary_reader
auto number_lexer = detail::lexer(detail::input_adapter(number_vector), false);
const auto result_number = number_lexer.scan();
const auto number_string = number_lexer.get_token_string();
+ // the number as the lexer read it, for SAX number_float(): unlike
+ // get_token_string(), which is meant for error messages and shortens
+ // long tokens, it is complete; the next scan() replaces it
+ const string_t number_text = number_lexer.get_string();
const auto result_remainder = number_lexer.scan();
using token_type = typename detail::lexer_base::token_type;
@@ -4122,10 +4126,7 @@ class binary_reader
number_string,
out_of_range::create(exception_id::number_overflow, concat("number overflow parsing '", number_string, '\''), nullptr));
}
- // number_string is a std::string, while the SAX interface takes a
- // string_t; convert explicitly, as the two are only implicitly
- // convertible for some string types
- return sax->number_float(parsed_float, string_t(number_string.data(), number_string.size()));
+ return sax->number_float(parsed_float, number_text);
}
case token_type::uninitialized:
case token_type::literal_true:
diff --git a/single_include/nlohmann/json.hpp b/single_include/nlohmann/json.hpp
index 473bfa894..d6320c897 100644
--- a/single_include/nlohmann/json.hpp
+++ b/single_include/nlohmann/json.hpp
@@ -22774,6 +22774,10 @@ class binary_reader
auto number_lexer = detail::lexer(detail::input_adapter(number_vector), false);
const auto result_number = number_lexer.scan();
const auto number_string = number_lexer.get_token_string();
+ // the number as the lexer read it, for SAX number_float(): unlike
+ // get_token_string(), which is meant for error messages and shortens
+ // long tokens, it is complete; the next scan() replaces it
+ const string_t number_text = number_lexer.get_string();
const auto result_remainder = number_lexer.scan();
using token_type = typename detail::lexer_base::token_type;
@@ -22800,10 +22804,7 @@ class binary_reader
number_string,
out_of_range::create(exception_id::number_overflow, concat("number overflow parsing '", number_string, '\''), nullptr));
}
- // number_string is a std::string, while the SAX interface takes a
- // string_t; convert explicitly, as the two are only implicitly
- // convertible for some string types
- return sax->number_float(parsed_float, string_t(number_string.data(), number_string.size()));
+ return sax->number_float(parsed_float, number_text);
}
case token_type::uninitialized:
case token_type::literal_true:
diff --git a/tests/src/unit-bjdata.cpp b/tests/src/unit-bjdata.cpp
index 304db5676..6a0dc0f8f 100644
--- a/tests/src/unit-bjdata.cpp
+++ b/tests/src/unit-bjdata.cpp
@@ -1278,6 +1278,25 @@ TEST_CASE("BJData")
CHECK(j.dump() == "3.141592653589793");
}
+ SECTION("long floating-point number")
+ {
+ // the SAX parser receives the number text as it is in the
+ // input, also when it is longer than the part of a token
+ // that error messages show
+ const std::vector lengths = {8192, 8193, 10000};
+ for (const auto length : lengths)
+ {
+ CAPTURE(length)
+ const std::string number = "1." + std::string(length - 2, '3');
+ std::vector vec = {'H', 'I', static_cast(length & 0xFF), static_cast(length >> 8)};
+ vec.insert(vec.end(), number.begin(), number.end());
+ SaxEventLogger logger;
+ CHECK(json::sax_parse(vec, &logger, json::input_format_t::bjdata));
+ CHECK(logger.events == std::vector({"number_float(" + number + ")"}));
+ CHECK(json::from_bjdata(vec).is_number_float());
+ }
+ }
+
SECTION("errors")
{
// error while parsing length
diff --git a/tests/src/unit-ubjson.cpp b/tests/src/unit-ubjson.cpp
index 315f1dea1..58e51b5b3 100644
--- a/tests/src/unit-ubjson.cpp
+++ b/tests/src/unit-ubjson.cpp
@@ -793,6 +793,25 @@ TEST_CASE("UBJSON")
CHECK(j.dump() == "3.141592653589793");
}
+ SECTION("long floating-point number")
+ {
+ // the SAX parser receives the number text as it is in the
+ // input, also when it is longer than the part of a token
+ // that error messages show
+ const std::vector lengths = {8192, 8193, 10000};
+ for (const auto length : lengths)
+ {
+ CAPTURE(length)
+ const std::string number = "1." + std::string(length - 2, '3');
+ std::vector vec = {'H', 'I', static_cast(length >> 8), static_cast(length & 0xFF)};
+ vec.insert(vec.end(), number.begin(), number.end());
+ SaxEventLogger logger;
+ CHECK(json::sax_parse(vec, &logger, json::input_format_t::ubjson));
+ CHECK(logger.events == std::vector({"number_float(" + number + ")"}));
+ CHECK(json::from_ubjson(vec).is_number_float());
+ }
+ }
+
SECTION("errors")
{
// error while parsing length
From 1f7250f77fd189ddc576f63222b68592e970f241 Mon Sep 17 00:00:00 2001
From: Niels Lohmann
Date: Wed, 18 Nov 2026 08:51:52 +0100
Subject: [PATCH 03/14] Write a binary subtype independently of
number_unsigned_t in dump() (#6135)
Signed-off-by: Niels Lohmann
---
include/nlohmann/detail/output/serializer.hpp | 47 +++++++++++++++++--
single_include/nlohmann/json.hpp | 47 +++++++++++++++++--
tests/src/unit-custom-number-types.cpp | 22 +++++++++
3 files changed, 108 insertions(+), 8 deletions(-)
diff --git a/include/nlohmann/detail/output/serializer.hpp b/include/nlohmann/detail/output/serializer.hpp
index eeba0a9de..22fcfa6ac 100644
--- a/include/nlohmann/detail/output/serializer.hpp
+++ b/include/nlohmann/detail/output/serializer.hpp
@@ -636,7 +636,7 @@ class serializer
put_literal("\"subtype\": ");
if (binary.has_subtype())
{
- dump_integer(binary.subtype());
+ dump_subtype(binary.subtype());
}
else
{
@@ -662,7 +662,7 @@ class serializer
put_literal("],\"subtype\":");
if (binary.has_subtype())
{
- dump_integer(binary.subtype());
+ dump_subtype(binary.subtype());
put_char('}');
}
else
@@ -1571,7 +1571,7 @@ class serializer
{
return n_digits + 3;
}
- x = x / 10000u;
+ x = static_cast(x / 10000u);
n_digits += 4;
}
}
@@ -1883,6 +1883,40 @@ class serializer
write_buffer_pos = pos;
}
+ /*!
+ @brief dump the subtype of a binary value
+
+ The subtype is a std::uint64_t, whatever the number types are. @ref
+ dump_integer converts its argument to the magnitude type of
+ number_unsigned_t, so it writes the subtype only if that type has at least
+ 64 bits; otherwise (it would truncate the subtype) the digits are written
+ one by one.
+
+ @param[in] subtype the subtype to dump
+ */
+ void dump_subtype(std::uint64_t subtype)
+ {
+ dump_subtype(subtype, std::integral_constant {});
+ }
+
+ void dump_subtype(std::uint64_t subtype, std::true_type /*magnitude has at least 64 bits*/)
+ {
+ dump_integer(subtype);
+ }
+
+ void dump_subtype(std::uint64_t subtype, std::false_type /*magnitude has less than 64 bits*/)
+ {
+ std::array digits{{}}; // 2^64 - 1 has 20 digits
+ std::size_t start = digits.size();
+ do
+ {
+ digits[--start] = static_cast('0' + (subtype % 10));
+ subtype /= 10;
+ }
+ while (subtype != 0);
+ put_string(digits, start, digits.size());
+ }
+
/*!
@brief dump an integer
@@ -2136,6 +2170,11 @@ class serializer
static constexpr bool magnitude_has_at_most_64_bits = std::numeric_limits::is_specialized
&& std::numeric_limits::digits <= 64;
+ /// whether every std::uint64_t fits number_magnitude_t (then dump_integer
+ /// can write a binary subtype)
+ static constexpr bool magnitude_has_at_least_64_bits = std::numeric_limits::is_specialized
+ && std::numeric_limits::digits >= 64;
+
/// whether @a x fits 64 bits: always if number_magnitude_t has at most
/// 64 bits (selected by type, as the comparison would be reported as
/// always true), else compared
@@ -2161,7 +2200,7 @@ class serializer
number_magnitude_t remove_sign(number_integer_t x) noexcept
{
JSON_ASSERT(x < 0);
- return static_cast(-(x + 1)) + 1;
+ return static_cast(static_cast(-(x + 1)) + 1);
}
private:
diff --git a/single_include/nlohmann/json.hpp b/single_include/nlohmann/json.hpp
index d6320c897..ae91542de 100644
--- a/single_include/nlohmann/json.hpp
+++ b/single_include/nlohmann/json.hpp
@@ -38123,7 +38123,7 @@ class serializer
put_literal("\"subtype\": ");
if (binary.has_subtype())
{
- dump_integer(binary.subtype());
+ dump_subtype(binary.subtype());
}
else
{
@@ -38149,7 +38149,7 @@ class serializer
put_literal("],\"subtype\":");
if (binary.has_subtype())
{
- dump_integer(binary.subtype());
+ dump_subtype(binary.subtype());
put_char('}');
}
else
@@ -39058,7 +39058,7 @@ class serializer
{
return n_digits + 3;
}
- x = x / 10000u;
+ x = static_cast(x / 10000u);
n_digits += 4;
}
}
@@ -39370,6 +39370,40 @@ class serializer
write_buffer_pos = pos;
}
+ /*!
+ @brief dump the subtype of a binary value
+
+ The subtype is a std::uint64_t, whatever the number types are. @ref
+ dump_integer converts its argument to the magnitude type of
+ number_unsigned_t, so it writes the subtype only if that type has at least
+ 64 bits; otherwise (it would truncate the subtype) the digits are written
+ one by one.
+
+ @param[in] subtype the subtype to dump
+ */
+ void dump_subtype(std::uint64_t subtype)
+ {
+ dump_subtype(subtype, std::integral_constant {});
+ }
+
+ void dump_subtype(std::uint64_t subtype, std::true_type /*magnitude has at least 64 bits*/)
+ {
+ dump_integer(subtype);
+ }
+
+ void dump_subtype(std::uint64_t subtype, std::false_type /*magnitude has less than 64 bits*/)
+ {
+ std::array digits{{}}; // 2^64 - 1 has 20 digits
+ std::size_t start = digits.size();
+ do
+ {
+ digits[--start] = static_cast('0' + (subtype % 10));
+ subtype /= 10;
+ }
+ while (subtype != 0);
+ put_string(digits, start, digits.size());
+ }
+
/*!
@brief dump an integer
@@ -39623,6 +39657,11 @@ class serializer
static constexpr bool magnitude_has_at_most_64_bits = std::numeric_limits::is_specialized
&& std::numeric_limits::digits <= 64;
+ /// whether every std::uint64_t fits number_magnitude_t (then dump_integer
+ /// can write a binary subtype)
+ static constexpr bool magnitude_has_at_least_64_bits = std::numeric_limits::is_specialized
+ && std::numeric_limits::digits >= 64;
+
/// whether @a x fits 64 bits: always if number_magnitude_t has at most
/// 64 bits (selected by type, as the comparison would be reported as
/// always true), else compared
@@ -39648,7 +39687,7 @@ class serializer
number_magnitude_t remove_sign(number_integer_t x) noexcept
{
JSON_ASSERT(x < 0);
- return static_cast(-(x + 1)) + 1;
+ return static_cast(static_cast(-(x + 1)) + 1);
}
private:
diff --git a/tests/src/unit-custom-number-types.cpp b/tests/src/unit-custom-number-types.cpp
index 58353d67e..09d716dc2 100644
--- a/tests/src/unit-custom-number-types.cpp
+++ b/tests/src/unit-custom-number-types.cpp
@@ -483,3 +483,25 @@ TEST_CASE("custom number types: 32-bit integers in the binary formats")
CHECK(json32::to_msgpack(values) == nlohmann::json::to_msgpack(values64));
CHECK(json32::to_ubjson(values) == nlohmann::json::to_ubjson(values64));
}
+
+TEST_CASE("custom number types: binary subtypes wider than the integer types")
+{
+ // the subtype of a binary value is a std::uint64_t, whatever the number types are
+ using json8 = nlohmann::json::with_integers_t;
+ using json16 = nlohmann::json::with_integers_t;
+ using json32 = nlohmann::json::with_integers_t;
+ const std::uint64_t max_uint64 = (std::numeric_limits::max)();
+
+ CHECK(json8::binary({1}, 300).dump() == "{\"bytes\":[1],\"subtype\":300}");
+ CHECK(json8::binary({200}, 255).dump() == "{\"bytes\":[200],\"subtype\":255}");
+ CHECK(json16::binary({1}, 65543).dump() == "{\"bytes\":[1],\"subtype\":65543}");
+ CHECK(json32::binary({1}, 4294967301u).dump() == "{\"bytes\":[1],\"subtype\":4294967301}");
+ CHECK(json32::binary({1}, max_uint64).dump() == "{\"bytes\":[1],\"subtype\":18446744073709551615}");
+ CHECK(json32::binary({1}, 0).dump() == "{\"bytes\":[1],\"subtype\":0}");
+ CHECK(json32::binary({1}, 4294967301u).dump(1) == "{\n \"bytes\": [1],\n \"subtype\": 4294967301\n}");
+ CHECK(json8::binary({1}).dump() == "{\"bytes\":[1],\"subtype\":null}");
+
+ // unchanged for the default number types
+ CHECK(nlohmann::json::binary({1}, 4294967301u).dump() == "{\"bytes\":[1],\"subtype\":4294967301}");
+ CHECK(nlohmann::json::binary({1}, max_uint64).dump(1) == "{\n \"bytes\": [1],\n \"subtype\": 18446744073709551615\n}");
+}
From 6ac411e14c0d18dc9116204f85eb7aba0dd27a96 Mon Sep 17 00:00:00 2001
From: Niels Lohmann
Date: Wed, 18 Nov 2026 08:52:02 +0100
Subject: [PATCH 04/14] Report the same error position for bulk number runs as
for byte-wise input (#6137)
Signed-off-by: Niels Lohmann
---
.../nlohmann/detail/input/binary_reader.hpp | 115 ++++++++++------
single_include/nlohmann/json.hpp | 115 ++++++++++------
tests/src/unit-binary_formats.cpp | 123 ++++++++++++++++++
3 files changed, 267 insertions(+), 86 deletions(-)
diff --git a/include/nlohmann/detail/input/binary_reader.hpp b/include/nlohmann/detail/input/binary_reader.hpp
index c7b1b92f8..f2facaabd 100644
--- a/include/nlohmann/detail/input/binary_reader.hpp
+++ b/include/nlohmann/detail/input/binary_reader.hpp
@@ -1927,6 +1927,21 @@ class binary_reader
return result;
}
+ /*!
+ @brief move past a value of @a size bytes, starting with @a head, that a
+ bulk run reads, as get() and get_number() would
+
+ Called before the value is passed on, so that an error reported while
+ passing it on (see @ref emit_float) has the position and the last byte
+ that reading the value byte by byte gives.
+ */
+ void bulk_advance(const std::size_t size, const unsigned char head)
+ {
+ ia.bulk_skip(size);
+ chars_read += size;
+ current = head;
+ }
+
/*!
@brief read the integers, floats, booleans, and nulls that follow in a
definite-length array, without the per-element bookkeeping of
@@ -1952,71 +1967,70 @@ class binary_reader
{
const auto* const data = reinterpret_cast(ia.bulk_data());
const unsigned char head = data[0];
- std::size_t size = 0;
bool accepted = false;
switch (head)
{
case 0x18:
- size = 2;
+ bulk_advance(2, head);
accepted = emit_unsigned(data[1]);
break;
case 0x19:
- size = 3;
+ bulk_advance(3, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x1A:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x1B:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x38:
- size = 2;
+ bulk_advance(2, head);
accepted = emit_cbor_negative_integer(data[1]);
break;
case 0x39:
- size = 3;
+ bulk_advance(3, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0x3A:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0x3B:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0xF4:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(false);
break;
case 0xF5:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(true);
break;
case 0xF6:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->null();
break;
case 0xFA:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xFB:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_float(load_big_endian(data + 1));
break;
default:
if (head <= 0x17)
{
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_unsigned(static_cast(head));
}
else if (head >= 0x20 && head <= 0x37)
{
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_integer(static_cast(0x20 - 1 - head));
}
else
@@ -2026,10 +2040,6 @@ class binary_reader
}
break;
}
- // as if read by get() and get_number(): current is the head byte
- ia.bulk_skip(size);
- chars_read += size;
- current = head;
--remaining;
if (JSON_HEDLEY_UNLIKELY(!accepted))
{
@@ -2867,73 +2877,72 @@ class binary_reader
{
const auto* const data = reinterpret_cast(ia.bulk_data());
const unsigned char head = data[0];
- std::size_t size = 0;
bool accepted = false;
switch (head)
{
case 0xC0: // nil
- size = 1;
+ bulk_advance(1, head);
accepted = sax->null();
break;
case 0xC2: // false
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(false);
break;
case 0xC3: // true
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(true);
break;
case 0xCA: // float 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xCB: // float 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xCC: // uint 8
- size = 2;
+ bulk_advance(2, head);
accepted = emit_unsigned(data[1]);
break;
case 0xCD: // uint 16
- size = 3;
+ bulk_advance(3, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xCE: // uint 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xCF: // uint 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xD0: // int 8
- size = 2;
+ bulk_advance(2, head);
accepted = emit_signed(static_cast(data[1]));
break;
case 0xD1: // int 16
- size = 3;
+ bulk_advance(3, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
case 0xD2: // int 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
case 0xD3: // int 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
default:
if (head <= 0x7F)
{
// positive fixint
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_unsigned(static_cast(head));
}
else if (head >= 0xE0)
{
// negative fixint
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_integer(static_cast(head));
}
else
@@ -2943,10 +2952,6 @@ class binary_reader
}
break;
}
- // as if read by get() and get_number(): current is the last byte
- ia.bulk_skip(size);
- chars_read += size;
- current = data[size - 1];
--remaining;
if (JSON_HEDLEY_UNLIKELY(!accepted))
{
@@ -3850,6 +3855,7 @@ class binary_reader
const auto* const data = reinterpret_cast(ia.bulk_data());
// UBJSON stores numbers big-endian, BJData little-endian
const bool swap = is_little_endian != (input_format == input_format_t::bjdata);
+ const std::size_t start = chars_read;
std::size_t read = 0;
bool accepted = true;
while (read < count && accepted)
@@ -3861,16 +3867,39 @@ class binary_reader
byte_swap(number);
}
++read;
+ // where passing the value on can report an error (see
+ // emit_float), the position is that after the value, as if it
+ // was read by get_number()
+ set_chars_read(start + (read * size), std::integral_constant()> {});
accepted = emit_ubjson_number(number);
}
- // as if read by get_number(): current is the last byte read
+ // get_number() does not change current
ia.bulk_skip(read * size);
- chars_read += read * size;
- current = data[(read * size) - 1];
+ chars_read = start + (read * size);
remaining -= read;
return accepted;
}
+ /*!
+ @brief whether a value of type @a NumberType can be finite and still
+ overflow number_float_t, which @ref emit_float reports as an error
+
+ False for the default number types, so that the loop in @ref
+ parse_ubjson_typed_run need not track the position per value.
+ */
+ template
+ static constexpr bool may_overflow_number_float() noexcept
+ {
+ return static_cast((std::numeric_limits::max)()) < static_cast((std::numeric_limits::max)());
+ }
+
+ void set_chars_read(const std::size_t position, std::true_type /*track*/) noexcept
+ {
+ chars_read = position;
+ }
+
+ void set_chars_read(const std::size_t /*position*/, std::false_type /*track*/) const noexcept {}
+
template::value, int> = 0>
bool emit_ubjson_number(const NumberType number)
{
diff --git a/single_include/nlohmann/json.hpp b/single_include/nlohmann/json.hpp
index ae91542de..e06c98452 100644
--- a/single_include/nlohmann/json.hpp
+++ b/single_include/nlohmann/json.hpp
@@ -20605,6 +20605,21 @@ class binary_reader
return result;
}
+ /*!
+ @brief move past a value of @a size bytes, starting with @a head, that a
+ bulk run reads, as get() and get_number() would
+
+ Called before the value is passed on, so that an error reported while
+ passing it on (see @ref emit_float) has the position and the last byte
+ that reading the value byte by byte gives.
+ */
+ void bulk_advance(const std::size_t size, const unsigned char head)
+ {
+ ia.bulk_skip(size);
+ chars_read += size;
+ current = head;
+ }
+
/*!
@brief read the integers, floats, booleans, and nulls that follow in a
definite-length array, without the per-element bookkeeping of
@@ -20630,71 +20645,70 @@ class binary_reader
{
const auto* const data = reinterpret_cast(ia.bulk_data());
const unsigned char head = data[0];
- std::size_t size = 0;
bool accepted = false;
switch (head)
{
case 0x18:
- size = 2;
+ bulk_advance(2, head);
accepted = emit_unsigned(data[1]);
break;
case 0x19:
- size = 3;
+ bulk_advance(3, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x1A:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x1B:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0x38:
- size = 2;
+ bulk_advance(2, head);
accepted = emit_cbor_negative_integer(data[1]);
break;
case 0x39:
- size = 3;
+ bulk_advance(3, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0x3A:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0x3B:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_cbor_negative_integer(load_big_endian(data + 1));
break;
case 0xF4:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(false);
break;
case 0xF5:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(true);
break;
case 0xF6:
- size = 1;
+ bulk_advance(1, head);
accepted = sax->null();
break;
case 0xFA:
- size = 5;
+ bulk_advance(5, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xFB:
- size = 9;
+ bulk_advance(9, head);
accepted = emit_float(load_big_endian(data + 1));
break;
default:
if (head <= 0x17)
{
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_unsigned(static_cast(head));
}
else if (head >= 0x20 && head <= 0x37)
{
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_integer(static_cast(0x20 - 1 - head));
}
else
@@ -20704,10 +20718,6 @@ class binary_reader
}
break;
}
- // as if read by get() and get_number(): current is the head byte
- ia.bulk_skip(size);
- chars_read += size;
- current = head;
--remaining;
if (JSON_HEDLEY_UNLIKELY(!accepted))
{
@@ -21545,73 +21555,72 @@ class binary_reader
{
const auto* const data = reinterpret_cast(ia.bulk_data());
const unsigned char head = data[0];
- std::size_t size = 0;
bool accepted = false;
switch (head)
{
case 0xC0: // nil
- size = 1;
+ bulk_advance(1, head);
accepted = sax->null();
break;
case 0xC2: // false
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(false);
break;
case 0xC3: // true
- size = 1;
+ bulk_advance(1, head);
accepted = sax->boolean(true);
break;
case 0xCA: // float 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xCB: // float 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_float(load_big_endian(data + 1));
break;
case 0xCC: // uint 8
- size = 2;
+ bulk_advance(2, head);
accepted = emit_unsigned(data[1]);
break;
case 0xCD: // uint 16
- size = 3;
+ bulk_advance(3, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xCE: // uint 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xCF: // uint 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_unsigned(load_big_endian(data + 1));
break;
case 0xD0: // int 8
- size = 2;
+ bulk_advance(2, head);
accepted = emit_signed(static_cast(data[1]));
break;
case 0xD1: // int 16
- size = 3;
+ bulk_advance(3, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
case 0xD2: // int 32
- size = 5;
+ bulk_advance(5, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
case 0xD3: // int 64
- size = 9;
+ bulk_advance(9, head);
accepted = emit_signed(load_big_endian(data + 1));
break;
default:
if (head <= 0x7F)
{
// positive fixint
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_unsigned(static_cast(head));
}
else if (head >= 0xE0)
{
// negative fixint
- size = 1;
+ bulk_advance(1, head);
accepted = sax->number_integer(static_cast(head));
}
else
@@ -21621,10 +21630,6 @@ class binary_reader
}
break;
}
- // as if read by get() and get_number(): current is the last byte
- ia.bulk_skip(size);
- chars_read += size;
- current = data[size - 1];
--remaining;
if (JSON_HEDLEY_UNLIKELY(!accepted))
{
@@ -22528,6 +22533,7 @@ class binary_reader
const auto* const data = reinterpret_cast(ia.bulk_data());
// UBJSON stores numbers big-endian, BJData little-endian
const bool swap = is_little_endian != (input_format == input_format_t::bjdata);
+ const std::size_t start = chars_read;
std::size_t read = 0;
bool accepted = true;
while (read < count && accepted)
@@ -22539,16 +22545,39 @@ class binary_reader
byte_swap(number);
}
++read;
+ // where passing the value on can report an error (see
+ // emit_float), the position is that after the value, as if it
+ // was read by get_number()
+ set_chars_read(start + (read * size), std::integral_constant()> {});
accepted = emit_ubjson_number(number);
}
- // as if read by get_number(): current is the last byte read
+ // get_number() does not change current
ia.bulk_skip(read * size);
- chars_read += read * size;
- current = data[(read * size) - 1];
+ chars_read = start + (read * size);
remaining -= read;
return accepted;
}
+ /*!
+ @brief whether a value of type @a NumberType can be finite and still
+ overflow number_float_t, which @ref emit_float reports as an error
+
+ False for the default number types, so that the loop in @ref
+ parse_ubjson_typed_run need not track the position per value.
+ */
+ template
+ static constexpr bool may_overflow_number_float() noexcept
+ {
+ return static_cast((std::numeric_limits::max)()) < static_cast((std::numeric_limits::max)());
+ }
+
+ void set_chars_read(const std::size_t position, std::true_type /*track*/) noexcept
+ {
+ chars_read = position;
+ }
+
+ void set_chars_read(const std::size_t /*position*/, std::false_type /*track*/) const noexcept {}
+
template::value, int> = 0>
bool emit_ubjson_number(const NumberType number)
{
diff --git a/tests/src/unit-binary_formats.cpp b/tests/src/unit-binary_formats.cpp
index 333252190..f9778d9e7 100644
--- a/tests/src/unit-binary_formats.cpp
+++ b/tests/src/unit-binary_formats.cpp
@@ -14,6 +14,7 @@ using nlohmann::json;
#include
#include
#include
+#include
#include
## Running example
@@ -906,6 +907,56 @@ CPMAddPackage("gh:nlohmann/json@3.12.0")
* * *
+## Nix
+
+!!! abstract "Summary"
+
+ package: [**`nlohmann_json`**](https://search.nixos.org/packages?channel=unstable&show=nlohmann_json&query=nlohmann_json)
+
+ - :octicons-tag-24: Available versions: current version of each Nixpkgs channel (may lag behind the latest release)
+ - :octicons-rocket-24: The package is maintained by the Nixpkgs community and updated after releases.
+ - :octicons-file-24: File issues at the [Nixpkgs issue tracker](https://github.com/NixOS/nixpkgs/issues)
+ - :octicons-question-24: [Nix website](https://nixos.org)
+
+If you are using [Nix](https://nixos.org) or [NixOS](https://nixos.org/manual/nixos/stable/), the library is available
+as the [nlohmann_json](https://search.nixos.org/packages?channel=unstable&show=nlohmann_json&query=nlohmann_json)
+package in [Nixpkgs](https://github.com/NixOS/nixpkgs). To try it in a temporary shell, execute
+
+```shell
+nix-shell -p nlohmann_json
+```
+
+On NixOS, the package can be installed system-wide by adding it to `configuration.nix`:
+
+```nix
+environment.systemPackages = [ pkgs.nlohmann_json ];
+```
+
+??? example "Example: CMake"
+
+ 1. Create the following files:
+
+ ```cpp title="example.cpp"
+ --8<-- "integration/nix/example.cpp"
+ ```
+
+ ```cmake title="CMakeLists.txt"
+ --8<-- "integration/nix/CMakeLists.txt"
+ ```
+
+ 2. Enter a shell that provides the package, CMake, and a C++ compiler:
+
+ ```sh
+ nix-shell -p nlohmann_json cmake
+ ```
+
+ 3. Compile the code:
+
+ ```sh
+ cmake -S . -B build
+ cmake --build build
+ ```
+
## Other package managers
The library is also contained in many other package repositories; [Repology](https://repology.org/project/nlohmann-json/versions) tracks the packaged
From 2951790d40ebf91ca08d9351d829b5ddc819dc04 Mon Sep 17 00:00:00 2001
From: Niels Lohmann
Date: Wed, 18 Nov 2026 08:52:54 +0100
Subject: [PATCH 09/14] Fix three dead links in the list of customers (#6147)
Signed-off-by: Niels Lohmann
---
docs/mkdocs/docs/home/customers.md | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/docs/mkdocs/docs/home/customers.md b/docs/mkdocs/docs/home/customers.md
index 336cc55c8..f4e9b4606 100644
--- a/docs/mkdocs/docs/home/customers.md
+++ b/docs/mkdocs/docs/home/customers.md
@@ -102,7 +102,7 @@ the result of an internet search. If you know further customers of the library,
- [**Apple iOS and macOS**](https://www.apple.com/macos), a family of operating systems developed by Apple, including iOS for mobile devices and macOS for desktop computers
- [**Chromium**](https://chromium.googlesource.com/chromium/src/+/main/third_party/nlohmann_json/), the open-source browser project that Google Chrome, Microsoft Edge, and many other browsers are built on, where the library is used as data container for on-device model execution
-- [**Google Fuchsia**](https://fuchsia.googlesource.com/third_party/json/), an open-source operating system developed by Google, designed to be secure, updatable, and adaptable across various devices
+- [**Google Fuchsia**](https://fuchsia.googlesource.com/fuchsia/+/refs/heads/main/scripts/prebuilts/swiftshader/build_config), an open-source operating system developed by Google, designed to be secure, updatable, and adaptable across various devices, where the library is used indirectly through bundled dependencies such as SwiftShader's debugger support and cppdap
- [**LG webOS**](https://github.com/webosose/com.webos.service.camera), a Linux-based operating system used in LG smart TVs, signage, and embedded devices
- [**Microsoft Azure Linux**](https://github.com/microsoft/azurelinux), a Linux distribution developed by Microsoft for Azure infrastructure and edge workloads
- [**OpenHarmony**](https://github.com/openharmony/third_party_json), an open-source operating system for smart devices and the foundation of HarmonyOS
@@ -174,7 +174,7 @@ the result of an internet search. If you know further customers of the library,
- [**NVIDIA Instant NGP**](https://github.com/NVlabs/instant-ngp/blob/master/src/nerf_loader.cu), an implementation of instant neural graphics primitives for rapid scene reconstruction
- [**NVIDIA TensorRT**](https://github.com/NVIDIA/TensorRT), an SDK for high-performance deep learning inference, including its TensorRT-LLM extension for large language models
- [**NVIDIA TensorRT-LLM**](https://github.com/NVIDIA/TensorRT-LLM/blob/main/cpp/tensorrt_llm/common/safetensors.cpp), a toolkit for optimizing and serving large language model inference on GPUs
-- [**ONNX Runtime**](https://github.com/microsoft/onnxruntime), a cross-platform inference and training accelerator for machine learning models
+- [**ONNX Runtime**](https://onnxruntime.ai), a cross-platform inference and training accelerator for machine learning models
- [**OpenVINO**](https://github.com/openvinotoolkit/openvino), Intel's toolkit for optimizing and deploying deep learning inference across CPUs, GPUs, and NPUs
- [**PaddleOCR**](https://github.com/PaddlePaddle/PaddleOCR/blob/main/deploy/cpp_infer/src/modules/text_detection/result.cc), an optical character recognition toolkit that turns documents and images into structured data
- [**PaddlePaddle**](https://github.com/PaddlePaddle/Paddle/blob/develop/paddle/ap/src/axpr/anf_expr.cc), a deep learning framework for distributed training and inference
@@ -216,7 +216,7 @@ the result of an internet search. If you know further customers of the library,
- [**Check Point**](https://www.checkpoint.com/about-us/copyright-and-trademarks/), a cybersecurity company specializing in threat prevention and network security solutions, offering a range of products designed to protect enterprises from cyber threats and ensure data integrity
- [**EasyEffects**](https://github.com/wwmm/easyeffects/blob/master/src/presets_manager.hpp), an audio effects processor for PipeWire offering limiting, compression and equalization
- [**espanso**](https://github.com/espanso/espanso/blob/dev/espanso-ui/src/win32/native.cpp), a cross-platform text expander
-- [**Karabiner-Elements**](https://github.com/pqrs-org/Karabiner-Elements/blob/main/src/share/app_icon.hpp), a keyboard customizer for macOS
+- [**Karabiner-Elements**](https://github.com/pqrs-org/Karabiner-Elements/blob/main/src/share/json_utility.hpp), a keyboard customizer for macOS
- [**MacType**](https://github.com/snowie2000/mactype/blob/directwrite/settings.h), a font rendering engine for Windows
- [**magicplan**](https://help.magicplan.app/acknowledgments), a mobile application for creating floor plans and interior designs using augmented reality
- [**Microsoft Office for Mac**](https://officecdnmac.microsoft.com/pr/legal/mac/OfficeforMacAttributions.html), a suite of productivity applications developed by Microsoft for macOS, including tools for word processing, spreadsheets, and presentations
From 0ac14610d6e5f194129a50ec0dc0030a07d5681a Mon Sep 17 00:00:00 2001
From: Shubham Shakti <130799986+0xmyst3ry@users.noreply.github.com>
Date: Wed, 18 Nov 2026 13:26:46 +0530
Subject: [PATCH 10/14] docs: correct erase() empty-range and initializer-list
move documentation (#6122)
Signed-off-by: Niels Lohmann
---
docs/mkdocs/docs/api/basic_json/basic_json.md | 4 +++-
docs/mkdocs/docs/api/basic_json/erase.md | 12 +++++++-----
docs/mkdocs/docs/api/basic_json/object.md | 4 +++-
3 files changed, 13 insertions(+), 7 deletions(-)
diff --git a/docs/mkdocs/docs/api/basic_json/basic_json.md b/docs/mkdocs/docs/api/basic_json/basic_json.md
index c029f519c..48c89dd20 100644
--- a/docs/mkdocs/docs/api/basic_json/basic_json.md
+++ b/docs/mkdocs/docs/api/basic_json/basic_json.md
@@ -265,7 +265,9 @@ basic_json(basic_json&& other) noexcept;
4. Depends on the called constructor. For types directly supported by the library (i.e., all types for which no
`to_json()` function was provided), a strong guarantee holds: if an exception is thrown, there are no changes to any
JSON value.
-5. Strong guarantee: if an exception is thrown, there are no changes to any JSON value.
+5. Strong guarantee: if an exception is thrown, there are no changes to any JSON value. Values that are moved into
+ `init` (e.g., `a` in `#!cpp json::object({std::move(a), 5})`) are moved when the initializer list is created,
+ before the constructor runs, and stay moved-from if it throws.
6. Strong guarantee: if an exception is thrown, there are no changes to any JSON value.
7. Strong guarantee: if an exception is thrown, there are no changes to any JSON value.
8. Strong guarantee: if an exception is thrown, there are no changes to any JSON value.
diff --git a/docs/mkdocs/docs/api/basic_json/erase.md b/docs/mkdocs/docs/api/basic_json/erase.md
index 68eccc5a3..728ba4ace 100644
--- a/docs/mkdocs/docs/api/basic_json/erase.md
+++ b/docs/mkdocs/docs/api/basic_json/erase.md
@@ -26,10 +26,12 @@ void erase(const size_type idx);
If called on a primitive type other than `#!json null`, the resulting JSON value will be `#!json null`.
-2. Remove an element range specified by `[first; last)` from a JSON value. The iterator `first` does not need to be
- dereferenceable if `first == last`: erasing an empty range is a no-op.
+2. Remove an element range specified by `[first; last)` from a JSON value. For arrays and objects, the iterator `first`
+ does not need to be dereferenceable if `first == last`: erasing an empty range is a no-op.
- If called on a primitive type other than `#!json null`, the resulting JSON value will be `#!json null`.
+ If called on a primitive type other than `#!json null`, the range must be `[begin(); end())`, and the resulting JSON
+ value will be `#!json null`. Any other range, including the empty ranges `[begin(); begin())` and
+ `[end(); end())`, throws [`invalid_iterator.204`](../../home/exceptions.md#jsonexceptioninvalid_iterator204).
3. Removes an element from a JSON object by key.
@@ -93,8 +95,8 @@ Strong exception safety: if an exception occurs, the original value stays intact
- Throws [`invalid_iterator.203`](../../home/exceptions.md#jsonexceptioninvalid_iterator203) if called on iterators
which does not belong to the current JSON value; example: `"iterators do not fit current value"`
- Throws [`invalid_iterator.204`](../../home/exceptions.md#jsonexceptioninvalid_iterator204) if called on a
- primitive type with invalid iterators (i.e., if `first != begin()` and `last != end()`); example: `"iterators out
- of range"`
+ primitive type with invalid iterators (i.e., if `first != begin()` or `last != end()`, which includes the empty
+ ranges `[begin(); begin())` and `[end(); end())`); example: `"iterators out of range"`
3. The function can throw the following exceptions:
- Throws [`type_error.307`](../../home/exceptions.md#jsonexceptiontype_error307) when called on a type other than
JSON object; example: `"cannot use erase() with null"`
diff --git a/docs/mkdocs/docs/api/basic_json/object.md b/docs/mkdocs/docs/api/basic_json/object.md
index 53d969e56..2378910d8 100644
--- a/docs/mkdocs/docs/api/basic_json/object.md
+++ b/docs/mkdocs/docs/api/basic_json/object.md
@@ -18,7 +18,9 @@ JSON object value
## Exception safety
-Strong guarantee: if an exception is thrown, there are no changes in the JSON value.
+Strong guarantee: if an exception is thrown, there are no changes in the JSON value. Values that are moved into `init`
+(e.g., `a` in `#!cpp json::object({std::move(a), 5})`) are moved when the initializer list is created, before this
+function runs, and stay moved-from if it throws.
## Exceptions
From 8c3335d41f9b457ea69da16fcef57ec8d9b4cb17 Mon Sep 17 00:00:00 2001
From: Aditya Singh Bakawat
Date: Wed, 18 Nov 2026 13:26:51 +0530
Subject: [PATCH 11/14] docs: correct assertion conditions and remove stale
diagnostic locations (#6131)
Signed-off-by: Niels Lohmann
---
docs/mkdocs/docs/api/macros/json_assert.md | 8 +++----
docs/mkdocs/docs/features/assertions.md | 28 +++++++---------------
2 files changed, 11 insertions(+), 25 deletions(-)
diff --git a/docs/mkdocs/docs/api/macros/json_assert.md b/docs/mkdocs/docs/api/macros/json_assert.md
index 158fe7a68..d29d801db 100644
--- a/docs/mkdocs/docs/api/macros/json_assert.md
+++ b/docs/mkdocs/docs/api/macros/json_assert.md
@@ -47,11 +47,9 @@ Therefore, assertions can be switched off by defining `NDEBUG`.
}
```
- Output:
-
- ```
- Assertion failed: (m_value.object->find(key) != m_value.object->end()), function operator[], file json.hpp, line 2144.
- ```
+ The assertion `#!cpp it != m_data.m_value.object->end()` fails in `#!cpp operator[]`.
+ The exact diagnostic format, source filename, and line number depend on the platform,
+ library version, and whether the single-header or multi-header version is used.
??? example "Example: user-defined behavior"
diff --git a/docs/mkdocs/docs/features/assertions.md b/docs/mkdocs/docs/features/assertions.md
index 2f2ad3ff7..c42f222c3 100644
--- a/docs/mkdocs/docs/features/assertions.md
+++ b/docs/mkdocs/docs/features/assertions.md
@@ -18,6 +18,10 @@ before including the `json.hpp` header.
## Function with runtime assertions
+The examples below identify the failing assertion and the function containing it.
+The exact diagnostic format, source filename, and line number depend on the platform,
+library version, and whether the single-header or multi-header version is used.
+
### Unchecked access to a const value
Function [`operator[]`](../api/basic_json/operator%5B%5D.md) implements unchecked access for arrays and objects. Whereas
@@ -46,11 +50,7 @@ See also the documentation on [element access](element_access/index.md).
}
```
- Output:
-
- ```
- Assertion failed: (it != m_data.m_value.object->end()), function operator[], file json.hpp, line 28795.
- ```
+ The assertion `#!cpp it != m_data.m_value.object->end()` fails in `#!cpp operator[]`.
??? example "Example 2: Invalid array index in a JSON pointer"
@@ -69,11 +69,7 @@ See also the documentation on [element access](element_access/index.md).
}
```
- Output:
-
- ```
- Assertion failed: (idx < m_data.m_value.array->size()), function operator[], file json.hpp, line 28758.
- ```
+ The assertion `#!cpp idx < ptr->m_data.m_value.array->size()` fails in `#!cpp get_unchecked`.
### Constructing from an uninitialized iterator range
@@ -96,11 +92,7 @@ uninitialized iterator is undefined behavior and yields a runtime assertion.
}
```
- Output:
-
- ```
- Assertion failed: (m_object != nullptr), function operator++, file iter_impl.hpp, line 368.
- ```
+ The assertion `#!cpp first.m_object != nullptr` fails in `#!cpp basic_json`.
### Operations on uninitialized iterators
@@ -123,11 +115,7 @@ behavior and yields a runtime assertion.
}
```
- Output:
-
- ```
- Assertion failed: (m_object != nullptr), function operator++, file iter_impl.hpp, line 368.
- ```
+ The assertion `#!cpp m_object != nullptr` fails in `#!cpp operator++`.
## Changes
From ccb253baf1b789c8b10f28f07ecfa521d67a9b45 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Wed, 18 Nov 2026 08:57:02 +0100
Subject: [PATCH 12/14] build(deps): bump mkdocs-material from 9.8.0 to 9.8.1
in /docs/mkdocs (#6141)
Signed-off-by: Niels Lohmann
---
docs/mkdocs/requirements.txt | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/docs/mkdocs/requirements.txt b/docs/mkdocs/requirements.txt
index 4014cf3b7..52c2e5843 100644
--- a/docs/mkdocs/requirements.txt
+++ b/docs/mkdocs/requirements.txt
@@ -2,7 +2,7 @@ wheel==0.48.0
mkdocs==1.6.1 # documentation framework
mkdocs-git-revision-date-localized-plugin==1.6.3 # plugin "git-revision-date-localized"
-mkdocs-material==9.8.0 # theme for mkdocs
+mkdocs-material==9.8.1 # theme for mkdocs
mkdocs-material-extensions==1.3.1 # extensions
mkdocs-minify-plugin==0.8.0 # plugin "minify"
mkdocs-redirects==1.2.3 # plugin "redirects"
From b927100ca153b27dcfeb4dea09afa52b8b8482ef Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Wed, 18 Nov 2026 08:57:19 +0100
Subject: [PATCH 13/14] build(deps): bump step-security/harden-runner from
2.22.3 to 2.22.4 (#6143)
Signed-off-by: Niels Lohmann
---
.github/workflows/cancel_closed_pr_runs.yml | 2 +-
.github/workflows/check_amalgamation.yml | 4 ++--
.github/workflows/check_docs_links.yml | 2 +-
.github/workflows/cifuzz.yml | 2 +-
.github/workflows/codeql-analysis.yml | 2 +-
.github/workflows/comment_check_amalgamation.yml | 2 +-
.github/workflows/dependency-review.yml | 2 +-
.github/workflows/flawfinder.yml | 2 +-
.github/workflows/json_view_benchmarks.yml | 2 +-
.github/workflows/labeler.yml | 2 +-
.github/workflows/publish_documentation.yml | 2 +-
.github/workflows/scorecards.yml | 2 +-
.github/workflows/semgrep.yml | 2 +-
.github/workflows/stale.yml | 2 +-
.github/workflows/ubuntu.yml | 10 +++++-----
15 files changed, 20 insertions(+), 20 deletions(-)
diff --git a/.github/workflows/cancel_closed_pr_runs.yml b/.github/workflows/cancel_closed_pr_runs.yml
index fd30c5047..7f0023f90 100644
--- a/.github/workflows/cancel_closed_pr_runs.yml
+++ b/.github/workflows/cancel_closed_pr_runs.yml
@@ -28,7 +28,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/check_amalgamation.yml b/.github/workflows/check_amalgamation.yml
index 448d0d85b..956524897 100644
--- a/.github/workflows/check_amalgamation.yml
+++ b/.github/workflows/check_amalgamation.yml
@@ -22,7 +22,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
@@ -46,7 +46,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/check_docs_links.yml b/.github/workflows/check_docs_links.yml
index 0ec9778e6..3cfc80274 100644
--- a/.github/workflows/check_docs_links.yml
+++ b/.github/workflows/check_docs_links.yml
@@ -20,7 +20,7 @@ jobs:
timeout-minutes: 30
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/cifuzz.yml b/.github/workflows/cifuzz.yml
index 02a5a8173..2bac97387 100644
--- a/.github/workflows/cifuzz.yml
+++ b/.github/workflows/cifuzz.yml
@@ -13,7 +13,7 @@ jobs:
runs-on: ubuntu-22.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/codeql-analysis.yml b/.github/workflows/codeql-analysis.yml
index aa982f139..5ebe01f10 100644
--- a/.github/workflows/codeql-analysis.yml
+++ b/.github/workflows/codeql-analysis.yml
@@ -27,7 +27,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/comment_check_amalgamation.yml b/.github/workflows/comment_check_amalgamation.yml
index 558d5fba4..f8a76d6e4 100644
--- a/.github/workflows/comment_check_amalgamation.yml
+++ b/.github/workflows/comment_check_amalgamation.yml
@@ -20,7 +20,7 @@ jobs:
pull-requests: write
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/dependency-review.yml b/.github/workflows/dependency-review.yml
index 8034aa1c8..373208049 100644
--- a/.github/workflows/dependency-review.yml
+++ b/.github/workflows/dependency-review.yml
@@ -21,7 +21,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/flawfinder.yml b/.github/workflows/flawfinder.yml
index 608523b7e..6978cc0cf 100644
--- a/.github/workflows/flawfinder.yml
+++ b/.github/workflows/flawfinder.yml
@@ -31,7 +31,7 @@ jobs:
security-events: write
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/json_view_benchmarks.yml b/.github/workflows/json_view_benchmarks.yml
index 49876a07b..d84cc43ac 100644
--- a/.github/workflows/json_view_benchmarks.yml
+++ b/.github/workflows/json_view_benchmarks.yml
@@ -54,7 +54,7 @@ jobs:
timeout-minutes: 60
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/labeler.yml b/.github/workflows/labeler.yml
index 004039586..5a38bd293 100644
--- a/.github/workflows/labeler.yml
+++ b/.github/workflows/labeler.yml
@@ -23,7 +23,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/publish_documentation.yml b/.github/workflows/publish_documentation.yml
index ba8f435bf..ffa22f33a 100644
--- a/.github/workflows/publish_documentation.yml
+++ b/.github/workflows/publish_documentation.yml
@@ -37,7 +37,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/scorecards.yml b/.github/workflows/scorecards.yml
index b2e08c488..2ccaabacb 100644
--- a/.github/workflows/scorecards.yml
+++ b/.github/workflows/scorecards.yml
@@ -40,7 +40,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/semgrep.yml b/.github/workflows/semgrep.yml
index ca73edb55..034b77562 100644
--- a/.github/workflows/semgrep.yml
+++ b/.github/workflows/semgrep.yml
@@ -36,7 +36,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/stale.yml b/.github/workflows/stale.yml
index b624f9f40..3d0573ace 100644
--- a/.github/workflows/stale.yml
+++ b/.github/workflows/stale.yml
@@ -16,7 +16,7 @@ jobs:
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
diff --git a/.github/workflows/ubuntu.yml b/.github/workflows/ubuntu.yml
index d8a467f29..9d3f6d823 100644
--- a/.github/workflows/ubuntu.yml
+++ b/.github/workflows/ubuntu.yml
@@ -80,7 +80,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
@@ -112,7 +112,7 @@ jobs:
target: [ci_test_single_header, ci_cppcheck, ci_cpplint, ci_reproducible_tests, ci_non_git_tests, ci_offline_testdata, ci_reuse_compliance, ci_test_valgrind]
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
@@ -178,7 +178,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
@@ -436,7 +436,7 @@ jobs:
runs-on: ubuntu-26.04
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
@@ -459,7 +459,7 @@ jobs:
target: [ci_test_examples, ci_test_build_documentation, ci_test_documentation_mermaid]
steps:
- name: Harden Runner
- uses: step-security/harden-runner@46b06cea07f9e64621fdf066ba77ac6915163d43 # v2.22.3
+ uses: step-security/harden-runner@1d88384fd173af6ecb012dfd0264a306b711241a # v2.22.4
with:
egress-policy: audit
From d732d616badc771ab1e85876b3a9eb8191fdf4c0 Mon Sep 17 00:00:00 2001
From: "dependabot[bot]" <49699333+dependabot[bot]@users.noreply.github.com>
Date: Wed, 18 Nov 2026 08:57:29 +0100
Subject: [PATCH 14/14] build(deps): bump semgrep from 1.184.0 to 1.185.0 in
/cmake/requirements (#6146)
Signed-off-by: Niels Lohmann
---
cmake/requirements/requirements-semgrep.txt | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/cmake/requirements/requirements-semgrep.txt b/cmake/requirements/requirements-semgrep.txt
index 028580449..f9754d99e 100644
--- a/cmake/requirements/requirements-semgrep.txt
+++ b/cmake/requirements/requirements-semgrep.txt
@@ -1 +1 @@
-semgrep==1.184.0
+semgrep==1.185.0