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

54 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 147KB 5/10000 · 5
54 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_if_uint64>> 23/10000 · 23
54 :116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The result is constructed from two pointers to `const char`. 60/10000 · 60
54 :171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocator Propagation 21/10000 · 21
54 :212
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — We can complicate the example further by extracting _several_ JSON values from the sequence of lines. 101/10000 · 101
55 :131
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Boost.JSON has been tested with the following compilers: 56/10000 · 56
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