2. Boost Json Translation (zh_Hans)
3. English
4. Zen

7 :46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The second, more powerful approach, is to provide the conversion implementation yourself. With Boost.JSON this is done by defining an overload of `tag_invoke` function (the benefits of this mechanism are outlined in http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2019/p1895r0.pdf[C++ proposal P1895]. In essence, `tag_invoke` provides a uniform interface for defining customization points by using argument-dependent lookup to find a viable overload from the point at which it is called. As the name suggests, a tag type is passed as an argument in order to: 562/10000 · 562
7 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If <<ref_try_value_to>> is used with a type, for which there's no `tag_invoke` overload of the form described in this section, but there is one of the form intended for <<ref_value_to>>, then the library still tries to perform the conversion. It uses the throwing overload, and attempts to convert any thrown exception into an {ref_error_code}. Note, though, that such approach will likely be slower then a dedicated overload. 426/10000 · 426
7 :36
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `value_to` behavior 19/10000 · 19
7 :40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To avoid creating such temporaries with an incorrect {ref_memory_resource}, using <<ref_value>>'s member functions <<ref_value_emplace_array>>, <<ref_value_emplace_object>>, and <<ref_value_emplace_string>> can be helpful. 222/10000 · 222
7 :25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {ref_polymorphic_allocator} do not acquire ownership; the caller is responsible for ensuring that the lifetime of the resource extends until it is no longer referenced. 168/10000 · 168
7 :36
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — is complicated and error-prone. 31/10000 · 31
7 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {ref_polymorphic_allocator} constructed from the {ref_memory_resource} used by the container. Ownership of this memory resource is not transferred. 147/10000 · 147
7 :26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_parse_options>> 21/10000 · 21
7 :23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — to a {std_ostream}. 19/10000 · 19
8 :13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Docs 4/10000 · 4
8 :64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Aliases* + <<ref_parser_for>> + <<ref_string_view>> 52/10000 · 52
8 :99
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocators 10/10000 · 10
8 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parses the input using the <<default_memory_resource, default memory 68/10000 · 68
8 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — choices of template parameters to be interoperable. 51/10000 · 51
8 :35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — library uses the <<ref_storage_ptr>> allocator model, has the same interface on all C++ versions, and has an optimized class layout to keep the size of JSON values small. <<ref_string>> also implements an improved interface that replaces extraneous overloads with ones that use <<ref_string_view>>. 298/10000 · 298
8 :29
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An empty object may be constructed without incurring any memory allocations using the <<default_memory_resource,default memory resource>>. A <<ref_storage_ptr>> can also be explicitly specified: 194/10000 · 194
8 :67
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similarly, an initializer list for an <<ref_object>> is always interpreted as an <<ref_object>>. In such cases, the initializer list must be a list of key-value pairs. For example, the following code will not compile because `1` is not convertible to a string: 260/10000 · 260
8 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **array**: An ordered list of values, like {std_vector}. 56/10000 · 56
8 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When an <<ref_array>> is formatted to a {std_ostream}, the result is a valid JSON. That is, the array will be output with square brackets and the comma separated list of values, as per the JSON specification. 208/10000 · 208
8 :26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An associative container of key-value pairs with unique keys, where the key 75/10000 · 75