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

320 :1270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — get_allocator 13/10000 · 13
:1148 :1148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function. 140/10000 · 140
320 :1181
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — max_bucket_count 16/10000 · 16
320 :1256
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class K> mapped_type& operator[](K&& k); ``` 143/10000 · 143
:1289 :1289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase the element pointed to by `position`. 43/10000 · 43
321 :1220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — contains 8/10000 · 8
:1179 :1179
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1359 :1359
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ``` 135/10000 · 135
321 :1392
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<M>(obj))) ``` 128/10000 · 128
321 :1282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; Blocking on `*this` and `other`. 115/10000 · 115
321 :1183
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — contains 8/10000 · 8
321 :1280
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node and Visit 21/10000 · 21
321 :1271
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` allocator_type get_allocator() const noexcept; ``` 54/10000 · 54
:1150 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
321 :1182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type max_bucket_count() const noexcept; ``` 55/10000 · 55
321 :1263
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Effects:;; If the container does not already contain an element with a key equivalent to `k`, inserts the value `std::pair<key_type const, mapped_type>(k, mapped_type())`. Returns:;; A reference to `x.second` where `x` is the element already in the container, or the newly inserted element with a key equivalent to `k`. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, pointers and references, but only if the insert causes the load to be greater than the maximum load. + + The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 927/10000 · 927
:1292 :1292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. Notes:;; This method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated. 454/10000 · 454
322 :1221
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ``` 123/10000 · 123
322 :1181
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Hash Policy 11/10000 · 11
322 :1364
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — unlike xref:#concurrent_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor. 119/10000 · 119