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

17 :60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `double` otherwise. 19/10000 · 19
17 :46
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — exception upon allocation. This is used to to achieve the invariant that no parsing or container operation will dynamically allocate memory. 140/10000 · 140
17 :109
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Problem Statement 17/10000 · 17
17 :40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — of JSON texts incrementally, returning each result as a <<ref_value>>. 70/10000 · 70
17 :64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 262/10000 · 262
18 :23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — — 1/10000 · 1
18 :171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 458/10000 · 458
18 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — https://nlohmann.github.io/json/classnlohmann_1_1basic__json_ab330c13ba254ea41fbc1c52c5c610f45.html[`json::parse`], which uses the default `std` allocator, and is designed for general use including mutation of the document after it is parsed. This library does not provide an interface to reuse temporary storage used during parsing or serialization on subsequent operations. |=== 380/10000 · 380
18 :76
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Comparison to RapidJSON 23/10000 · 23
:95 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_kind,`kind::array`>> 26/10000 · 26
18 :48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — a parameter of a type convertible to <<ref_string_view>> and two 64/10000 · 64
18 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Contexts and Composite Types 28/10000 · 28
18 :86
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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: 193/10000 · 193
18 :61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The result is created via <<ref_value_to_number>>. 50/10000 · 50
18 :49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_is_deallocate_trivial>> 29/10000 · 29
18 :111
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We would like an allocator model using a single type `T` with the following properties: 87/10000 · 87
18 :42
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_stack>> 19/10000 · 19
19 :23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — https://github.com/boostorg/json/actions?query=workflow%3Afuzz+branch%3Adevelop[image:https://github.com/boostorg/json/workflows/fuzz/badge.svg?branch=develop[fuzz]] 165/10000 · 165
19 :184
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — With strategic use of the right memory resources, parser instance, and calculated upper limits on buffer sizes, it is possible to parse and examine JSON without __any__ dynamic memory allocations. This is explored in more detail in a later section. 248/10000 · 248
19 :65
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Methodology 11/10000 · 11