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

10 :33
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The storage pointer remembers the value of <<ref_is_deallocate_trivial>> 72/10000 · 72
10 :44
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {cpp}17 improves the allocator model by representing the low-level allocation operation with an abstract interface called {ref_memory_resource}, which is not parameterized on the element type, and has no traits: 211/10000 · 211
10 :43
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The polymorphic allocator is propagated recursively. Child elements of child elements will use the same memory resource as the parent. 134/10000 · 134
10 :26
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parse a string containing a complete serialized JSON text, and return 69/10000 · 69
10 :27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_object>>, or <<ref_string>>. 34/10000 · 34
11 :13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — https://drone.io/[Drone] 24/10000 · 24
11 :78
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — <<ref_has_value_from>> + <<ref_has_value_to>> + <<ref_is_deallocate_trivial>> + <<ref_is_described_class>> + <<ref_is_described_enum>> + <<ref_is_map_like>> + <<ref_is_null_like>> + <<ref_is_optional_like>> + <<ref_is_path_like>> + <<ref_is_sequence_like>> + <<ref_is_string_like>> + <<ref_is_tuple_like>> + <<ref_is_variant_like>> + <<ref_result_for>> + <<ref_try_value_to_tag>> + <<ref_value_from_tag>> + <<ref_value_to_tag>> 427/10000 · 427
11 :120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When a library type is used as the element type of a PMR container; that is, a container which uses a {ref_polymorphic_allocator}, the memory resource will automatically propagate to the type and all of its children: 216/10000 · 216
:39 :39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parses the input using an instance of 37/10000 · 37
11 :63
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {icon_bad} Poor separation of concerns. The `basic_json` container 66/10000 · 66
11 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similar to the `std` counterpart, elements may be accessed directly by their key with bounds checking using <<ref_object_at>>, or without bounds checking using <<ref_object_operator_lb_rb>> which creates a null element if the key does not already exist: 253/10000 · 253
11 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In all cases, the <<ref_storage_ptr>> owned by an <<ref_object>>, <<ref_array>>, or <<ref_value>> constructed from an initializer list will be propagated to each element, recursively. 183/10000 · 183
11 :37
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Working With Values 19/10000 · 19
11 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A contiguous range of characters. The library assumes that the contents of 74/10000 · 74
11 :28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — small strings. 14/10000 · 14
11 :81
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — is positive and its value is greater than `UINT64_MAX`, 55/10000 · 55
11 :76
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Passing Data to Conversion Functions 36/10000 · 36
11 :59
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — template such as `value_to_tag<T>`) so that its http://eel.is/c++draft/basic.lookup.argdep#2[associated namespaces and entities] are examined when name lookup is performed. 172/10000 · 172
:36 :36
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The result is equal to the input value. 39/10000 · 39
11 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — before type-erasing the resource, allowing the value to be queried at run-time. 79/10000 · 79