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

282 :1103
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — clear 5/10000 · 5
282 :1061
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>&& source); ``` 203/10000 · 203
282 :1212
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — emplace_and_[c]visit 20/10000 · 20
282 :1238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — try_emplace 11/10000 · 11
282 :1149
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transparent insert_and_[c]visit 31/10000 · 31
282 :1068
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void clear() noexcept; ``` 33/10000 · 33
282 :1149
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node or Visit 20/10000 · 20
282 :1164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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. 567/10000 · 567
282 :1045
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — equal_range 11/10000 · 11
282 :1065
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invalidates iterators belonging to `*this`. 43/10000 · 43
282 :1148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()` 83/10000 · 83
283 :443
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — modularization and hopefully make it easier to track Release subversion. 72/10000 · 72
283 :1158
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`. + + The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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. 707/10000 · 707
283 :1104
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void clear() noexcept; ``` 33/10000 · 33
283 :1068
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transfers all the element nodes from `source` whose key is not already present in `*this`. 90/10000 · 90
283 :1213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args, class F1, class F2> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ``` 215/10000 · 215
283 :1239
	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
283 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K, class F1, class F2> bool insert_and_visit(K&& k, F1 f1, F2 f2); template<class K, class F1, class F2> bool insert_and_cvisit(K&& k, F1 f1, F2 f2); ``` 175/10000 · 175
283 :1072
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases all elements in the container. 37/10000 · 37
283 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> insert_return_type insert_or_visit(node_type&& nh, F f); template<class F> insert_return_type insert_or_cvisit(node_type&& nh, F f); ``` 161/10000 · 161