Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
13766fc435 |
No files matched your search
@@ -100,8 +100,7 @@ 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
|
[`root()`](root.md). New values (and the element sequences of an edited array/object) go to storage owned by the
|
||||||
document, allocated on demand.
|
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
|
- **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. Such a
|
sees the new value; a view of a value that a later edit replaces or drops keeps showing what it last held. An edit
|
||||||
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
|
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
|
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).
|
as further edits happen (earlier buffers of edited text are kept alive, not overwritten).
|
||||||
|
|||||||
@@ -164,9 +164,7 @@ general.
|
|||||||
The same switch happens, for the same reason, when overload 1. replaces a multi-node array/object value with a
|
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
|
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
|
originally stepped over `target`'s whole subtree by its node count, which no longer applies once `target` is a
|
||||||
one-node scalar. This also holds when `target` is no longer part of the document (an edit erased or replaced it, or
|
one-node scalar.
|
||||||
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
|
## Examples
|
||||||
|
|
||||||
|
|||||||
@@ -48,10 +48,11 @@ namespace detail
|
|||||||
{
|
{
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@brief implements the Grisu2 algorithm for binary to decimal floating-point
|
@brief implements binary to decimal floating-point conversion: the shortest
|
||||||
conversion.
|
digits of Zmij (see zmij.hpp) for IEEE 754 binary64 numbers, and the Grisu2
|
||||||
|
algorithm for all other formats.
|
||||||
|
|
||||||
This implementation is a slightly modified version of the reference
|
The Grisu2 implementation is a slightly modified version of the reference
|
||||||
implementation which may be obtained from
|
implementation which may be obtained from
|
||||||
http://florian.loitsch.com/publications (bench.tar.gz).
|
http://florian.loitsch.com/publications (bench.tar.gz).
|
||||||
|
|
||||||
|
|||||||
@@ -257,7 +257,7 @@ struct ieee_binary_format<53> // binary64
|
|||||||
|
|
||||||
These formats (float, double, and long double where it is binary64, e.g.
|
These formats (float, double, and long double where it is binary64, e.g.
|
||||||
with MSVC or on Apple arm64) are converted by parse_float_native(). The
|
with MSVC or on Apple arm64) are converted by parse_float_native(). The
|
||||||
predicate is the one the serializer uses to choose Grisu2.
|
predicate is the one the serializer uses to choose to_chars() over snprintf.
|
||||||
*/
|
*/
|
||||||
template<typename FloatType>
|
template<typename FloatType>
|
||||||
struct has_native_float_format
|
struct has_native_float_format
|
||||||
|
|||||||
@@ -915,7 +915,7 @@ class binary_writer
|
|||||||
JSON_THROW(out_of_range::create(exception_id::subtype_out_of_range, concat("subtype ", std::to_string(subtype), " is too large for ", what, " (max 255)"), &j));
|
JSON_THROW(out_of_range::create(exception_id::subtype_out_of_range, concat("subtype ", std::to_string(subtype), " is too large for ", what, " (max 255)"), &j));
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @throw other_error.407 always
|
/// @throw other_error.502 always
|
||||||
JSON_HEDLEY_NO_RETURN JSON_HEDLEY_NEVER_INLINE
|
JSON_HEDLEY_NO_RETURN JSON_HEDLEY_NEVER_INLINE
|
||||||
static void throw_size_marker_required(const BasicJsonType& j)
|
static void throw_size_marker_required(const BasicJsonType& j)
|
||||||
{
|
{
|
||||||
|
|||||||
@@ -2033,8 +2033,9 @@ class serializer
|
|||||||
}
|
}
|
||||||
|
|
||||||
// If number_float_t is an IEEE-754 single or double precision number,
|
// If number_float_t is an IEEE-754 single or double precision number,
|
||||||
// use the Grisu2 algorithm to produce short numbers which are
|
// use to_chars() to produce short numbers which are guaranteed to
|
||||||
// guaranteed to round-trip, using strtof and strtod, resp.
|
// round-trip, using strtof and strtod, resp. (the shortest digits of
|
||||||
|
// Zmij for binary64, the Grisu2 algorithm for binary32).
|
||||||
//
|
//
|
||||||
// NB: The test below works if <long double> == <double>.
|
// NB: The test below works if <long double> == <double>.
|
||||||
static constexpr bool is_ieee_single_or_double
|
static constexpr bool is_ieee_single_or_double
|
||||||
|
|||||||
@@ -384,24 +384,11 @@ class editor
|
|||||||
// for the container is linear in the size of the document, so
|
// for the container is linear in the size of the document, so
|
||||||
// links (which are marked in the slot) avoid it.
|
// links (which are marked in the slot) avoid it.
|
||||||
node* const p = parent_known ? parent : find_parent(m_doc, slot);
|
node* const p = parent_known ? parent : find_parent(m_doc, slot);
|
||||||
if (p != nullptr)
|
if (p != nullptr && ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0))
|
||||||
{
|
|
||||||
if ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0)
|
|
||||||
{
|
{
|
||||||
block_of(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;
|
*slot = e.scalar;
|
||||||
slot->flags = static_cast<std::uint8_t>(slot->flags | linked);
|
slot->flags = static_cast<std::uint8_t>(slot->flags | linked);
|
||||||
return;
|
return;
|
||||||
|
|||||||
@@ -194,9 +194,7 @@ inline node* block_of(document_data& d, node* n, std::size_t extra)
|
|||||||
h->len = n->len;
|
h->len = n->len;
|
||||||
h->next = static_cast<std::uint32_t>(used);
|
h->next = static_cast<std::uint32_t>(used);
|
||||||
node* o = h + 1;
|
node* o = h + 1;
|
||||||
// (the bound on o keeps the copy inside the block even if the elements
|
for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n); c != e;)
|
||||||
// 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)
|
if (object)
|
||||||
{
|
{
|
||||||
@@ -278,41 +276,6 @@ 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<const node*> 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<node*>(c) : nullptr; // NOLINT(cppcoreguidelines-pro-type-const-cast): the nodes belong to the document
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace view
|
} // namespace view
|
||||||
} // namespace detail
|
} // namespace detail
|
||||||
NLOHMANN_JSON_NAMESPACE_END
|
NLOHMANN_JSON_NAMESPACE_END
|
||||||
@@ -849,7 +849,7 @@ class basic_json_view
|
|||||||
return !navigation::editable() || m_doc->edits == nullptr;
|
return !navigation::editable() || m_doc->edits == nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// the member of this object with @a key (the last one if the key occurs more than once), or nullptr
|
/// the member of this object with @a key (the first one if the key occurs more than once), or nullptr
|
||||||
NLOHMANN_VIEW_ALWAYS_INLINE const node* find_key(string_view_t key) const
|
NLOHMANN_VIEW_ALWAYS_INLINE const node* find_key(string_view_t key) const
|
||||||
{
|
{
|
||||||
return find_key(key, std::integral_constant<bool, is_editable> {});
|
return find_key(key, std::integral_constant<bool, is_editable> {});
|
||||||
|
|||||||
Generated
+9
-7
@@ -11642,7 +11642,7 @@ struct ieee_binary_format<53> // binary64
|
|||||||
|
|
||||||
These formats (float, double, and long double where it is binary64, e.g.
|
These formats (float, double, and long double where it is binary64, e.g.
|
||||||
with MSVC or on Apple arm64) are converted by parse_float_native(). The
|
with MSVC or on Apple arm64) are converted by parse_float_native(). The
|
||||||
predicate is the one the serializer uses to choose Grisu2.
|
predicate is the one the serializer uses to choose to_chars() over snprintf.
|
||||||
*/
|
*/
|
||||||
template<typename FloatType>
|
template<typename FloatType>
|
||||||
struct has_native_float_format
|
struct has_native_float_format
|
||||||
@@ -31147,7 +31147,7 @@ class binary_writer
|
|||||||
JSON_THROW(out_of_range::create(exception_id::subtype_out_of_range, concat("subtype ", std::to_string(subtype), " is too large for ", what, " (max 255)"), &j));
|
JSON_THROW(out_of_range::create(exception_id::subtype_out_of_range, concat("subtype ", std::to_string(subtype), " is too large for ", what, " (max 255)"), &j));
|
||||||
}
|
}
|
||||||
|
|
||||||
/// @throw other_error.407 always
|
/// @throw other_error.502 always
|
||||||
JSON_HEDLEY_NO_RETURN JSON_HEDLEY_NEVER_INLINE
|
JSON_HEDLEY_NO_RETURN JSON_HEDLEY_NEVER_INLINE
|
||||||
static void throw_size_marker_required(const BasicJsonType& j)
|
static void throw_size_marker_required(const BasicJsonType& j)
|
||||||
{
|
{
|
||||||
@@ -36006,10 +36006,11 @@ namespace detail
|
|||||||
{
|
{
|
||||||
|
|
||||||
/*!
|
/*!
|
||||||
@brief implements the Grisu2 algorithm for binary to decimal floating-point
|
@brief implements binary to decimal floating-point conversion: the shortest
|
||||||
conversion.
|
digits of Zmij (see zmij.hpp) for IEEE 754 binary64 numbers, and the Grisu2
|
||||||
|
algorithm for all other formats.
|
||||||
|
|
||||||
This implementation is a slightly modified version of the reference
|
The Grisu2 implementation is a slightly modified version of the reference
|
||||||
implementation which may be obtained from
|
implementation which may be obtained from
|
||||||
http://florian.loitsch.com/publications (bench.tar.gz).
|
http://florian.loitsch.com/publications (bench.tar.gz).
|
||||||
|
|
||||||
@@ -39519,8 +39520,9 @@ class serializer
|
|||||||
}
|
}
|
||||||
|
|
||||||
// If number_float_t is an IEEE-754 single or double precision number,
|
// If number_float_t is an IEEE-754 single or double precision number,
|
||||||
// use the Grisu2 algorithm to produce short numbers which are
|
// use to_chars() to produce short numbers which are guaranteed to
|
||||||
// guaranteed to round-trip, using strtof and strtod, resp.
|
// round-trip, using strtof and strtod, resp. (the shortest digits of
|
||||||
|
// Zmij for binary64, the Grisu2 algorithm for binary32).
|
||||||
//
|
//
|
||||||
// NB: The test below works if <long double> == <double>.
|
// NB: The test below works if <long double> == <double>.
|
||||||
static constexpr bool is_ieee_single_or_double
|
static constexpr bool is_ieee_single_or_double
|
||||||
|
|||||||
Generated
+3
-53
@@ -5564,9 +5564,7 @@ inline node* block_of(document_data& d, node* n, std::size_t extra)
|
|||||||
h->len = n->len;
|
h->len = n->len;
|
||||||
h->next = static_cast<std::uint32_t>(used);
|
h->next = static_cast<std::uint32_t>(used);
|
||||||
node* o = h + 1;
|
node* o = h + 1;
|
||||||
// (the bound on o keeps the copy inside the block even if the elements
|
for (const node* c = d.first_child_edited(n), *e = d.child_end_edited(n); c != e;)
|
||||||
// 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)
|
if (object)
|
||||||
{
|
{
|
||||||
@@ -5648,41 +5646,6 @@ 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<const node*> 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<node*>(c) : nullptr; // NOLINT(cppcoreguidelines-pro-type-const-cast): the nodes belong to the document
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace view
|
} // namespace view
|
||||||
} // namespace detail
|
} // namespace detail
|
||||||
NLOHMANN_JSON_NAMESPACE_END
|
NLOHMANN_JSON_NAMESPACE_END
|
||||||
@@ -6559,24 +6522,11 @@ class editor
|
|||||||
// for the container is linear in the size of the document, so
|
// for the container is linear in the size of the document, so
|
||||||
// links (which are marked in the slot) avoid it.
|
// links (which are marked in the slot) avoid it.
|
||||||
node* const p = parent_known ? parent : find_parent(m_doc, slot);
|
node* const p = parent_known ? parent : find_parent(m_doc, slot);
|
||||||
if (p != nullptr)
|
if (p != nullptr && ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0))
|
||||||
{
|
|
||||||
if ((p->flags & node_flags::moved) == 0 || moved_capacity(m_doc, p) == 0)
|
|
||||||
{
|
{
|
||||||
block_of(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;
|
*slot = e.scalar;
|
||||||
slot->flags = static_cast<std::uint8_t>(slot->flags | linked);
|
slot->flags = static_cast<std::uint8_t>(slot->flags | linked);
|
||||||
return;
|
return;
|
||||||
@@ -11066,7 +11016,7 @@ class basic_json_view
|
|||||||
return !navigation::editable() || m_doc->edits == nullptr;
|
return !navigation::editable() || m_doc->edits == nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
/// the member of this object with @a key (the last one if the key occurs more than once), or nullptr
|
/// the member of this object with @a key (the first one if the key occurs more than once), or nullptr
|
||||||
NLOHMANN_VIEW_ALWAYS_INLINE const node* find_key(string_view_t key) const
|
NLOHMANN_VIEW_ALWAYS_INLINE const node* find_key(string_view_t key) const
|
||||||
{
|
{
|
||||||
return find_key(key, std::integral_constant<bool, is_editable> {});
|
return find_key(key, std::integral_constant<bool, is_editable> {});
|
||||||
|
|||||||
@@ -589,76 +589,6 @@ 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"}]})"));
|
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)
|
#if !defined(JSON_NOEXCEPTION)
|
||||||
TEST_CASE("json_view edits: the size of a text arena")
|
TEST_CASE("json_view edits: the size of a text arena")
|
||||||
{
|
{
|
||||||
|
|||||||
Reference in new issue
Block a user