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

5 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — But since the elements aren't ordered, the output of: 53/10000 · 53
5 :21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Boost.Unordered offers a catalog of hash containers with different standards compliance levels, performances and intented usage scenarios: 138/10000 · 138
5 :15
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The http://en.wikipedia.org/wiki/Hash_table[Wikipedia article on hash tables^] has a good summary of the implementation issues for hash tables in general. 154/10000 · 154
5 :21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The hash function comes first as you might want to change the hash function but not the equality predicate. For example, if you wanted to use the https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a hash^] you could write: 263/10000 · 263
5 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times. 183/10000 · 183
5 :9
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Wikipedia_. https://en.wikipedia.org/wiki/Hash_table[Hash table^]. + 69/10000 · 69
5 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Visitation-based API 20/10000 · 20
5 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The rest of this section applies only to open-addressing and concurrent containers. 83/10000 · 83
5 :13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In order to decide which bucket to place an element in, the container applies the hash function, `Hash`, to the element's key (for sets the key is the whole element, but is referred to as the key so that the same terminology can be used for sets and maps). This returns a value of type `std::size_t`. `std::size_t` has a much greater range of values then the number of buckets, so the container applies another transformation to that value to choose a bucket to place the element in. 483/10000 · 483
5 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::unordered_[multi]set` and `boost::unordered_[multi]map` provide a conformant implementation for {cpp}11 (or later) compilers of the latest standard revision of {cpp} unordered associative containers, with very minor deviations as noted. The containers are fully https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^]. 453/10000 · 453
5 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::bucket-groups.png[align=center] 38/10000 · 38
:10 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Using in your project 21/10000 · 21
5 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copyright (C) 2005-2008 Daniel James 36/10000 · 36
5 :7
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_map.adoc[Class Template +++<code style="color: inherit;">+++unordered_map+++</code>+++] 112/10000 · 112
5 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::hash_is_avalanching` in `<boost/container_hash/hash_is_avalanching.hpp>`. Use that header directly instead. `<boost/unordered/hash_traits.hpp>` will be removed in the future. 182/10000 · 182
:280 :280
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
5 :27
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Open-addressing and concurrent containers use the provided hash function `Hash` as-is if `hash_is_avalanching<Hash>::value` is `true`; otherwise, they implement a bit-mixing post-processing stage to increase the quality of hashing at the expense of extra computational cost. 274/10000 · 274
:239 :239
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
5 :12
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As a result of its using open addressing, the interface of `boost::unordered_node_set` deviates in a number of aspects from that of `boost::unordered_set`/`std::unordered_set`: 176/10000 · 176
5 :10
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Even though it acts as a container, `boost::concurrent_node_map` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access and modification are done through user-provided _visitation functions_ that are passed to `concurrent_node_map` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios. 541/10000 · 541