Exit Zen
17
:117
English
In this snippet `time_point` is converted using `tag_invoke` overload that takes `as_iso_8601`, `ip_address` is converted using `tag_invoke` overload that takes `as_string`, and {std_vector} is converted using a generic conversion provided by the library.
133/2550 · 255
17
:78
English
If we implemented conversion for `user_ns::ip_address` manually with this approach, it would look like this:
51/1080 · 108
17
:83
English
.<<ref_value>> Accessors [%autowidth,cols=8] |=== |Kind |Representation |Emplacement |Kind Test |Pointer Access |`result` Access |Checked Access |Unchecked Access
112/1620 · 162
17
:46
English
exception upon allocation. This is used to to achieve the invariant that no parsing or container operation will dynamically allocate memory.
44/1400 · 140
17
:109
English
Problem Statement
4/170 · 17
17
:40
English
of JSON texts incrementally, returning each result as a <<ref_value>>.
51/700 · 70
17
:161
English
By default, the parser is strict and only accepts JSON compliant with the standard. However this behavior can be relaxed by filling out an options structure enabling one or more extensions. Here we use a static buffer and enable two non-standard extensions:
85/2570 · 257
17
:56
English
Parses the input using the static member function
22/490 · 49
17
:74
English
{icon_good} Full-featured, including JSON Pointer, CBOR, and others.
42/680 · 68
17
:64
English
As with the parser, the serializer may be reused by calling <<ref_serializer_reset>>. This sets up the object to serialize a new instance and retains previously allocated memory. This can result in performance improvements when multiple variables are serialized.
121/2620 · 262
17
:60
English
`double` otherwise.
13/190 · 19
18
:23
English
—
1/100 · 1
18
:48
English
a parameter of a type convertible to <<ref_string_view>> and two
60/640 · 64
18
:122
English
Contexts and Composite Types
8/280 · 28
18
:86
English
Since the type being converted is embedded into the function's signature, user-provided overloads are visible to argument-dependent lookup and will be candidates when a conversion is performed:
63/1930 · 193
:95
:95
English
<<ref_kind,`kind::array`>>
57/260 · 26
18
:49
English
<<ref_is_deallocate_trivial>>
63/290 · 29
18
:111
English
We would like an allocator model using a single type `T` with the following properties:
34/870 · 87
18
:42
English
<<ref_value_stack>>
43/190 · 19
18
:171
English
The parser in this library implements a https://en.wikipedia.org/wiki/Online_algorithm[__streaming algorithm__]; it can process JSON piece-by-piece, without the requirement that the entire input is available from the start. The parser uses a temporary memory allocation to do its work. If you plan on parsing multiple JSONs, for example in a network server, keeping the same parser instance will allow re-use of this temporary storage, improving performance.
186/4580 · 458