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

9 :9
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:debuggability.adoc[] 25/10000 · 25
9 :55
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It is not specified how member functions other than `rehash` and `reserve` affect the bucket count, although `insert` can only invalidate iterators when the insertion causes the container's load to be greater than the maximum allowed. For most implementations this means that `insert` will only change the number of buckets when this happens. Iterators can be invalidated by calls to `insert`, `rehash` and `reserve`. 417/10000 · 417
9 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ^.^h|*Concurrent* ^| `boost::concurrent_node_set` + `boost::concurrent_node_map` ^| `boost::concurrent_flat_set` + `boost::concurrent_flat_map` 143/10000 · 143
9 :27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The standard requires that pointers to elements aren't invalidated, so 70/10000 · 70
9 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```cpp struct iequal_to { bool operator()(std::string const& x, std::string const& y) const { return boost::algorithm::iequals(x, y, std::locale()); } }; 153/10000 · 153
9 :18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — GCC 12 + libstdc++-v3, x64 26/10000 · 26
9 :81
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — On the other hand, a visitation function can _not_ access the container itself: 79/10000 · 79
9 :52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Container Statistics 20/10000 · 20
9 :35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If instead of `boost::unordered_set` we had used `xref:reference/unordered_flat_set.adoc[boost::unordered_flat_set]`, the diagram would look as follows: 152/10000 · 152
9 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In accordance with the standard specification, `boost::unordered_[multi]map::emplace` supports piecewise pair construction: 123/10000 · 123
9 :30
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — It's worth noting that this approach is only used by pass:[libc++] and pass:[libstdc++]; the MSVC Dinkumware implementation uses a different one. A more detailed analysis of the standard containers can be found http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered.html[here]. 289/10000 · 289
9 :18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By default, the closed-addressing containers will show the `[hash_function]` and `[key_eq]`, the `[spare_hash_function]` and `[spare_key_eq]` if applicable, the `[allocator]`, and the elements. Using the view "detailed" adds the `[bucket_count]` and `[max_load_factor]`. Conversely, using the view "simple" shows only the elements, with no other items present. 360/10000 · 360
9 :18
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copyright (C) 2024 Braden Ganetsky 34/10000 · 34
9 :11
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_set.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_set.hpp>+++</code>+++ Synopsis] 135/10000 · 135
9 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Migrated the documentation to a multipage format using Antora. 62/10000 · 62
9 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it). 138/10000 · 138
9 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it). 138/10000 · 138
:240 :240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
9 :349
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
9 :331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11