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

30 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — when reading the input. For example, `std::getline` removes the endline characters from the string it produces. 111/10000 · 111
31 :75
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Boost.JSON offers these features: 33/10000 · 33
31 :270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The library's generic algorithms recognize when you are converting a <<ref_value>> to a container which resembles an array or object, so if you wanted to turn a JSON array into a vector of customers you might write: 215/10000 · 215
31 :88
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — floating-point coordinate pairs. 32/10000 · 32
31 :111
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Comparison to SIMD JSON 23/10000 · 23
31 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_try_as_object>> 27/10000 · 27
31 :79
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Type satisfying <<ref_is_optional_like>> 40/10000 · 40
31 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — perform allocations. 20/10000 · 20
31 :117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Full Precision Number Parsing 29/10000 · 29
32 :77
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fast compilation 16/10000 · 16
32 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<parse_citm_catalog_json,*citm_catalog.json*>> 47/10000 · 47
32 :118
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This is quite an interesting data structure, which is optimized to work well with the SIMD parser. It makes very good design choices for the intended use-case. However it is not well suited as a vocabulary type due to the necessary limitations. 244/10000 · 244
32 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_as_object>> 23/10000 · 23
32 :79
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the input value is empty, the result is a `null`. Otherwise it is 68/10000 · 68
32 :70
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_static_resource>> 23/10000 · 23
32 :118
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The default algorithm that the library uses to parse numbers is fast, but may result in slight precision loss. This may not be suitable for some applications, so there is an option to enable an alternative algorithm that doesn't have that flaw, but is somewhat slower. To do this, you also need to use <<ref_parse_options>> structure. 334/10000 · 334
33 :78
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Require only C++11 18/10000 · 18
33 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1.69MB 6/10000 · 6
33 :123
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {icon_bad} Sequential access only, via `ParsedJson::BasicIterator` 66/10000 · 66
33 :95
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_value_get_object>> 24/10000 · 24