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

5 :14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As a result of its using open addressing, the interface of `boost::unordered_flat_set` deviates in a number of aspects from that of `boost::unordered_flat_set`/`std::unordered_flat_set`: 186/10000 · 186
:238 :238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
5 :14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As a result of its using open addressing, the interface of `boost::unordered_flat_map` deviates in a number of aspects from that of `boost::unordered_map`/`std::unordered_map`: 176/10000 · 176
6 :6
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:hash_quality.adoc[] 24/10000 · 24
6 :41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — can be in any order. For example, it might be: 46/10000 · 46
6 :27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ^h| ^h|*Node-based* ^h|*Flat* 29/10000 · 29
6 :18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Data Structure 14/10000 · 14
6 :25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```cpp boost::unordered_map<std::string, int, hash::fnv_1a> dictionary; ``` 75/10000 · 75
6 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The erasure benchmarks erase all `n` elements randomly until the container is empty. Erasure by key uses `erase(const key_type&)` to remove entire groups of equivalent elements in each operation. 195/10000 · 195
6 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An introduction to hash table implementations. Discusses the differences between closed-addressing and open-addressing approaches. 130/10000 · 130
6 :47
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The first thing a new user of Boost.Unordered concurrent containers will notice is that these classes _do not provide iterators_ (which makes them technically not https://en.cppreference.com/w/cpp/named_req/Container[Containers^] in the C++ standard sense). The reason for this is that iterators are inherently thread-unsafe. Consider this hypothetical code: 358/10000 · 358
6 :22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Hash Post-mixing and the Avalanching Property 45/10000 · 45
6 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Retrieving the elements for a given key is simple. The same process is applied to the key to find the correct bucket. Then the key is compared with the elements in the bucket to find any elements that match (using the equality predicate `Pred`). If the hash function has worked well the elements will be evenly distributed amongst the buckets so only a small number of elements will need to be examined. 403/10000 · 403
6 :16
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Deduction Guides 16/10000 · 16
6 :22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An array of "buckets" is allocated and each bucket in turn points to its own individual linked list. This makes meeting the standard requirements of bucket iteration straight-forward. Unfortunately, iteration of the entire container is often times slow using this layout as each bucket must be examined for occupancy, yielding a time complexity of `O(bucket_count() + size())` when the standard requires complexity to be `O(size())`. 433/10000 · 433
6 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — To visualize Boost.Unordered containers in the Natvis framework in your project, simply add the file link:https://github.com/boostorg/unordered/blob/develop/extra/boost_unordered.natvis[/extra/boost_unordered.natvis] to your Visual Studio project as an "Existing Item". 269/10000 · 269
6 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copyright (C) 2022-2025 Christian Mazakas 41/10000 · 41
6 :8
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_multimap.adoc[Class Template +++<code style="color: inherit;">+++unordered_multimap+++</code>+++] 122/10000 · 122
6 :15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added `pull(const_iterator)` to open-addressing containers. This operation 74/10000 · 74
6 :282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11