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

317 :1337
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> bool try_emplace(const key_type& k, Args&&... args); template<class... Args> bool try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> bool try_emplace(K&& k, Args&&... args); ``` 233/10000 · 233
317 :1380
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a new element into the table or updates an existing one by assigning to the contained value. 100/10000 · 100
317 :1270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — swap 4/10000 · 4
317 :1170
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — count 5/10000 · 5
317 :1262
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F1, class F2> size_type insert_and_visit(std::initializer_list<value_type> il, F1 f1, F2 f2); template<class F1, class F2> size_type insert_and_cvisit(std::initializer_list<value_type> il, F1 f1, F2 f2); ``` 229/10000 · 229
317 :1261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `*this` is greater than its original maximum load, invalidates all iterators associated to `*this`. 248/10000 · 248
317 :1141
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`. 56/10000 · 56
317 :1172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_count() const noexcept; ``` 51/10000 · 51
317 :1250
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns `std::make_pair(b.end(), b.end())`. Notes:;; The `template<class K>` overloads only participate 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. 533/10000 · 533
:1282 :1282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
318 :1208
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
318 :1171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — bucket_count 12/10000 · 12
318 :1343
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it. 131/10000 · 131
318 :1382
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`. 92/10000 · 92
318 :1271
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void swap(concurrent_flat_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ``` 192/10000 · 192
318 :1171
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
:1269 :1269
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
:1266 :1266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
318 :1143
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the container. 104/10000 · 104
318 :1177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of buckets. 33/10000 · 33