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

55 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A array containing only floating-point numbers. 47/10000 · 47
55 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_try_as_uint64>> 27/10000 · 27
55 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For composite types (sequences, tuples, described classes, etc.) conversion of contained objects is applied recursively. For example: 133/10000 · 133
55 :172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The containers <<ref_array>>, <<ref_object>>, and <<ref_value>> all propagate the memory resource they were constructed with to child elements: 143/10000 · 143
55 :220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Controlling Memory 18/10000 · 18
56 :133
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — clang: 3.5, 3.6, 3.7, 3.8, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 63/10000 · 63
56 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<parse_random_json,*random.json*>> 35/10000 · 35
56 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_as_uint64>> 23/10000 · 23
56 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Here, the map is converted into an <<ref_object>>, since it matches <<ref_is_map_like>>. Each of its keys is converted into a <<ref_string>>, as `std::string` matches <<ref_is_string_like>>, and each of its values is converted into an <<ref_array>>, as `std::pair` matches <<ref_is_tuple_like>>. Finally, elements of pairs are converted into a `std::int64_t` number and a `bool`. 379/10000 · 379
56 :180
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This propagation acts recursively, containers within containers will all have the resource propagated. Once a container is constructed, its memory resource can never be changed. 177/10000 · 177
56 :221
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — After default construction, or after <<ref_stream_parser_reset>> is called with no arguments, the <<ref_value>> produced after a successful parse operation uses the default memory resource. To use a different memory resource, call `reset` with the resource to use. Here we use a <<ref_monotonic_resource>>, which is optimized for parsing but not subsequent modification: 370/10000 · 370
57 :134
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — gcc: 4.8, 4.9, 5, 6, 7, 8, 9, 10, 11, 12 40/10000 · 40
57 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 499KB 5/10000 · 5
57 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_get_uint64>> 24/10000 · 24
57 :137
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — :leveloffset: +1 16/10000 · 16
57 :184
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Resource Lifetime 17/10000 · 17
57 :232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To achieve performance and memory efficiency, the parser uses a temporary storage area to hold intermediate results. This storage is reused when parsing more than one JSON text, reducing the total number of calls to allocate memory and thus improving performance. Upon construction, the memory resource used to perform allocations for this temporary storage area may be specified. Otherwise, the default memory resource is used. In addition to a memory resource, the parser can make use of a caller-owned buffer for temporary storage. This can help avoid dynamic allocations for small inputs. The following example uses a four kilobyte temporary buffer for the parser, and falls back to the default memory resource if needed: 725/10000 · 725
58 :135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — msvc: 14.0, 14.1, 14.2, 14.3 28/10000 · 28
58 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A JSON with lots of Cyrillic characters. 40/10000 · 40
:95 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_kind,`kind::double_`>> 28/10000 · 28