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

351 :1309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ``` 88/10000 · 88
:1256 :1256
	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
351 :1479
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<M>(obj))) 126/10000 · 126
351 :1489
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void clear() noexcept; ``` 33/10000 · 33
351 :1366
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — contains 8/10000 · 8
351 :1272
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ``` 88/10000 · 88
351 :1368
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void swap(concurrent_node_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ``` 192/10000 · 192
351 :1360
	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
:1240 :1240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
351 :1270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The average number of elements per bucket. 53/10000 · 53
351 :1351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container. 268/10000 · 268
352 :1374
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — hash_function 13/10000 · 13
352 :1315
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the 'one past the end' element in the bucket with index `n`. 158/10000 · 158
:1258 :1258
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
352 :1484
	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
352 :1493
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases all elements in the table. 33/10000 · 33
352 :1367
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ``` 123/10000 · 123
352 :1278
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the 'one past the end' element in the bucket with index `n`. 158/10000 · 158
352 :1374
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swaps the contents of the table with the parameter. 51/10000 · 51
352 :1367
	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, 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. 902/10000 · 902