Exit Zen
4
:22
English
and removals.
4/130 · 13
4
:33
English
As discussed previously, we prefer to define a non-throwing overload of `tag_invoke` for <<ref_try_value_to>>, rather then the throwing overload for <<ref_value_to>>, as the latter can fallback to the former without performance degradation.
157/2400 · 240
4
:25
English
For example, consider this alternative implementation of `tag_invoke` for `ip_address` from the section <<custom_conversions>>.
89/1270 · 127
4
:34
English
When a two element initializer list is nested within an enclosing initializer list, it is unclear whether it represents an <<ref_array>> or an <<ref_object>>:
111/1580 · 158
5
:46
English
The specific behavior is controlled by an optional parameter of type <<ref_set_pointer_options>>. For example, here's the same example with a different option:
97/1590 · 159
5
:18
English
A sequence container of JSON values supporting dynamic size and fast, random
28/760 · 76
5
:32
English
It exposes both a sequence API and a tuple API. But converting from <<ref_value>> to `user_ns::ip_address` would not be able to use implementation for sequences, since those are constructed empty and then populated one element at a time, while `ip_address` has a fixed size of 4. The tuple conversion would fit, though. The only problem is that <<ref_is_tuple_like>> has a lower priority than <<ref_is_sequence_like>>. In order to circumvent this, the user only needs to specialize <<ref_is_sequence_like>> to not match `ip_address`.
377/5330 · 533
5
:37
English
If you need to combine incremental parsing with direct parsing, you can resort to <<ref_parser_for>>. `parser_for<T>` is an instantiation of <<ref_basic_parser>> that parses into an object of type `T`, and is what <<ref_parse_into>> uses under the hood.
210/2530 · 253
5
:30
English
For the class `ip_address` from the section <<custom_conversions>> this overload may look like this:
84/1000 · 100
5
:43
English
Similar to its standard library counterpart, elements may be accessed directly by their 0-based index with bounds checking using <<ref_array_at>>, or without bounds checking using <<ref_array_operator_lb_rb>>:
166/2090 · 209
5
:21
English
<<default_memory_resource,default resource>>, an implementation-defined instance which always uses the equivalent of global operator new and delete.
152/1480 · 148
5
:21
English
require that <<ref_value>> be declared as a class template, which would impose an additional compilation burden. By avoiding the template, most of the function definitions in the library can be excluded from the headers and emitted in a separate static or dynamic library.
101/2720 · 272
5
:66
English
In this library the types <<ref_array>>, <<ref_object>>, and <<ref_string>> hold JSON arrays, objects, and strings respectively while the type <<ref_value>> is a special variant which can hold any JSON element. Here we construct an empty object and then insert the elements above:
223/2800 · 280
5
:43
English
In such cases, if every element consists of a string followed by a single value, then the enclosing initializer list is interpreted as an <<ref_object>>. Otherwise, it is interpreted as an <<ref_array>>.
123/2030 · 203
6
:42
English
Direct serialization doesn't require any special components and works with the regular <<ref_serializer>> and <<ref_serialize>>.
107/1280 · 128
6
:26
English
All inserted values will use the same {ref_memory_resource} as the container
40/760 · 76
6
:38
English
The overload lets us use `ip_address` with <<ref_try_value_to>>.
76/640 · 64
6
:36
English
This implementation explicitly creates an <<ref_array>> rather than relying on assignment from an initializer list. But the array uses default {ref_memory_resource}, not the one used by `jv`.
108/1910 · 191
6
:52
English
For the complete listing of all available member functions and nested types, see the reference page for <<ref_array>>.
63/1180 · 118
6
:26
English
"Why use <<ref_storage_ptr>> over {ref_polymorphic_allocator}?:: {ref_polymorphic_allocator} treats the memory resource as a reference with respect to ownership. Boost.JSON uses a reference counted smart pointer container to simplify the lifetime management of memory resources. In addition to being reference counted, <<ref_storage_ptr>> can function as an uncounted reference wrapper around a {ref_memory_resource}.
260/4170 · 417