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

301 :1113
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); 147/10000 · 147
:1291 :1291
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
301 :1318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `template<class K, class\... Args, class F>` 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. 382/10000 · 382
:1220 :1220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
301 :1117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` allocator_type get_allocator() const; ``` 45/10000 · 45
301 :1207
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move insert_and_[c]visit 24/10000 · 24
301 :1214
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ``` 92/10000 · 92
301 :1097
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void max_load_factor(float z); ``` 41/10000 · 41
301 :1120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An iterator pointing to an element with key equivalent to `k`, or `b.end()` if no such element exists. Notes:;; The templated overloads containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are non-standard extensions which allow you to use a compatible hash function and equality predicate for a key of a different type in order to avoid an expensive type cast. In general, its use is not encouraged and instead the `K` member function templates should be used. + + 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. 852/10000 · 852
301 :1196
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Lookup 6/10000 · 6
302 :1232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The iterator following `position` before the erasure. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated. 420/10000 · 420
302 :1154
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` allocator_type get_allocator() const; ``` 45/10000 · 45
302 :1119
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` 3/10000 · 3
302 :1293
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Initializer List and Visit 33/10000 · 33
:1320 :1320
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — -- 2/10000 · 2
302 :1222
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — erase_if by Key 15/10000 · 15
:1121 :1121
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
302 :1208
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F1, class F2> bool insert_and_visit(value_type&& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(value_type&& obj, F1 f1, F2 f2); ``` 179/10000 · 179
302 :1219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extracts the element with key equivalent to `k`, if it exists. 62/10000 · 62
302 :1102
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Effects:;; Does nothing, as the user is not allowed to change this parameter. Kept for compatibility with `boost::unordered_set`. 129/10000 · 129