2. Boost Json Translation (zh_Hans)
3. Doc / Pages / Io / Parsing (adoc)
4. English
5. Zen

28 :103
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When `allow_invalid_utf16` is enabled, the parser will not throw an error in the case of illegal leading, trailing, or half a surrogate. Instead, it will replace the invalid UTF-16 code point(s) with the Unicode replacement character. 234/10000 · 234
29 :113
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When enabling comment support take extra care not to drop whitespace 68/10000 · 68
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 :117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Full Precision Number Parsing 29/10000 · 29
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 :129
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that full precision number parsing requires the algorithm to see the full number. This means, that when used with <<ref_stream_parser>>, additional memory allocations may be necessary to store the number parts which were so far accepted by the parser. The library does try its best to avoid such allocations. 313/10000 · 313
34 :135
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parser 6/10000 · 6
35 :136
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Instances of <<ref_parser>> and <<ref_stream_parser>> offer functionality beyond what is available when using the <<ref_parse>> free functions: 143/10000 · 143
36 :139
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — More control over memory 24/10000 · 24
37 :140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Streaming API, parse input JSON incrementally 45/10000 · 45
38 :141
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Improved performance when parsing multiple JSON texts 53/10000 · 53
39 :142
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Ignore non-JSON content after the end of a JSON text 52/10000 · 52
40 :144
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The parser implementation uses temporary storage space to accumulate values during parsing. When using the <<ref_parse>> free functions, this storage is allocated and freed in each call. However, by declaring an instance of <<ref_parser>> or <<ref_stream_parser>>, this temporary storage can be reused when parsing more than one JSON text, reducing the total number of dynamic memory allocations. 396/10000 · 396
41 :151
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To use the <<ref_parser>>, declare an instance. Then call <<ref_parser_write>> once with the buffer containing representing the input JSON. Finally, call <<ref_parser_release>> to take ownership of the resulting <<ref_value>> upon success. This example persists the parser instance in a class member to reuse across calls: 322/10000 · 322
42 :162
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Sometimes a protocol may have a JSON text followed by data that is in a different format or specification. The JSON portion can still be parsed by using the function <<ref_parser_write_some>>. Upon success, the return value will indicate the number of characters consumed from the input, which will exclude the non-JSON characters: 331/10000 · 331
43 :173
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The parser instance may be constructed with parse options which allow some non-standard JSON extensions to be recognized: 121/10000 · 121
44 :181
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Streaming Parser 16/10000 · 16
45 :182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The <<ref_stream_parser>> implements a https://en.wikipedia.org/wiki/Online_algorithm[__streaming algorithm__]; it allows incremental processing of large JSON inputs using one or more contiguous character buffers. The entire input JSON does not need to be loaded into memory at once. A network server can use the streaming interface to process incoming JSON in fixed-size amounts, providing these benefits: 406/10000 · 406
46 :189
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — CPU consumption per I/O cycle is bounded 40/10000 · 40
47 :190
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Memory consumption per I/O cycle is bounded 43/10000 · 43