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

362 :1396
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ float load_factor() const noexcept; ``` 46/10000 · 46
362 :1305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Hash Policy 11/10000 · 11
362 :1400
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> node_type extract_if(const key_type& k, F f); template<class K, class F> node_type extract_if(K&& k, F f); ``` 135/10000 · 135
:1401 :1401
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
362 :1286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Loading an unordered_flat_set from an archive 45/10000 · 45
362 :1296
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void rehash(size_type n); ``` 36/10000 · 36
:1376 :1376
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
363 :1411
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` 3/10000 · 3
363 :1344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — load_factor 11/10000 · 11
363 :1285
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A deduction guide will not participate in overload resolution if any of the following are true: 95/10000 · 95
363 :1520
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; `f` is passed a non-const reference to `x`. + + The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` 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. 727/10000 · 727
363 :1525
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The table's allocator. 33/10000 · 33
363 :1401
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `static_cast<float>(size())/static_cast<float>(bucket_count())`, or `0` if `bucket_count() == 0`. 108/10000 · 108
363 :1307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — load_factor 11/10000 · 11
363 :1405
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extracts the element `x` with key equivalent to `k`, if it exists and `f(x)` is `true`. 87/10000 · 87
363 :1403
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Hash Policy 11/10000 · 11
363 :1288
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Deletes all preexisting elements of an `unordered_flat_set` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_flat_set` `other` saved to the storage read by `ar`. 222/10000 · 222
363 :1300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Changes the number of buckets 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. 248/10000 · 248
363 :1378
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Statistics 10/10000 · 10
364 :1414
	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