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

26 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```plaintext (gdb) print example_unordered_map $1 = boost::unordered_map with 3 elements = {["C"] = "c", ["B"] = "b", ["A"] = "a"} (gdb) print example_unordered_map_begin $2 = iterator = { {first = "C", second = "c"} } (gdb) print example_unordered_map_end $3 = iterator = { end iterator } (gdb) print example_unordered_set $4 = boost::unordered_set with 3 elements = {[0] = "c", [1] = "b", [2] = "a"} (gdb) print example_unordered_set_begin $5 = iterator = { "c" } (gdb) print example_unordered_set_end $6 = iterator = { end iterator } ``` 540/10000 · 540
26 :28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_concurrent_flat_map_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/concurrent_flat_map_fwd.hpp>+++</code>+++ Synopsis] 155/10000 · 155
26 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.85.0 14/10000 · 14
:327 :327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
:287 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
26 :281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_ENABLE_STATS` 30/10000 · 30
26 :392
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races: 342/10000 · 342
26 :375
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races: 342/10000 · 342
26 :322
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races: 342/10000 · 342
:294 :294
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
26 :339
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races: 342/10000 · 342
26 :329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Configuration Macros 20/10000 · 20
26 :275
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Configuration Macros 20/10000 · 20
:286 :286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
26 :326
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Configuration Macros 20/10000 · 20
27 :27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_flat_map.adoc[`unordered_flat_map`] 60/10000 · 60
27 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Member function `lower_bound(k)` and `upper_bound(k)` 53/10000 · 53
27 :85
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The design of `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` has been guided by Peter Dimov's https://pdimov.github.io/articles/unordered_dev_plan.html[Development Plan for Boost.Unordered^]. We discuss here the most relevant principles. 292/10000 · 292
27 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — boost::unordered_multiset<point> points; ``` 44/10000 · 44
27 :80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Successful Lookup 17/10000 · 17