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

10 :62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As for pointers and references, they are never invalidated for node-based containers (`boost::unordered_[multi]set`, `boost::unordered_[multi]map`, `boost::unordered_node_set`, `boost::unordered_node_map`), but they will be when rehashing occurs for `boost::unordered_flat_set` and `boost::unordered_flat_map`: this is because these containers store elements directly into their holding buckets, so when allocating a new bucket array the elements must be transferred by means of move construction. 497/10000 · 497
10 :53
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **Closed-addressing containers** are fully compliant with the C++ specification 79/10000 · 79
10 :28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — the elements can't be stored in one array, but will need a layer of indirection instead - losing the efficiency and most of the memory gain, the main advantages of open addressing. 180/10000 · 180
10 :44
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — struct ihash { std::size_t operator()(std::string const& x) const { std::size_t seed = 0; std::locale locale; 109/10000 · 109
:20 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insertion 9/10000 · 9
10 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Access to a different container is allowed, though: 51/10000 · 51
10 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If we globally define the macro `BOOST_UNORDERED_ENABLE_STATS`, open-addressing and concurrent containers will calculate some internal statistics directly correlated to the quality of the hash function: 202/10000 · 202
10 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::buckets-oa.png[] 23/10000 · 23
10 :36
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Additionally, the same functionality is provided via non-standard `boost::unordered::piecewise_construct` and Boost.Tuple: 122/10000 · 122
10 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done: 560/10000 · 560
10 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By default, the open-addressing containers will show the `[hash_function]`, `[key_eq]`, `[allocator]`, and the elements. Using the view "simple" shows only the elements, with no other items present. Both the SIMD and the non-SIMD implementations are viewable through the Natvis framework. 288/10000 · 288
10 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) 146/10000 · 146
10 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_set.adoc[Class Template +++<code style="color: inherit;">+++unordered_set+++</code>+++] 112/10000 · 112
10 :22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.87.0 - Major update 29/10000 · 29
10 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _T_ 3/10000 · 3
10 :246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
10 :242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Description 11/10000 · 11
10 :351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Template Parameters* 21/10000 · 21
10 :333
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Template Parameters* 21/10000 · 21
10 :283
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Template Parameters* 21/10000 · 21