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

338 :1199
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_flat_set<Key, T, Hash, Pred, Alloc>& x, const unordered_flat_set<Key, T, Hash, Pred, Alloc>& y); ``` 205/10000 · 205
338 :1235
	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
338 :1313
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ float max_load_factor() const noexcept; ``` 50/10000 · 50
339 :1348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The behavior of this function is undefined if `this\->get_allocator() != source.get_allocator()`. 97/10000 · 97
339 :1272
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_size(size_type n) const; ``` 52/10000 · 52
339 :1228
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — rehash 6/10000 · 6
:1439 :1439
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; No `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: + + -- ```c++ 238/10000 · 238
339 :1453
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parallel erase_if 17/10000 · 17
339 :1329
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` hasher hash_function() const; ``` 37/10000 · 37
339 :1235
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_size(size_type n) const; ``` 52/10000 · 52
:1334 :1334
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
339 :1318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
339 :1205
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types). 184/10000 · 184
:1238 :1238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
339 :1318
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; Returns the container's maximum load factor. 55/10000 · 55
340 :1350
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This function does not copy or move any elements and instead simply relocates the nodes from `source` into `*this`. 115/10000 · 115
340 :1277
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`. 81/10000 · 81
340 :1229
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void rehash(size_type n); ``` 36/10000 · 36
:1447 :1447
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) 133/10000 · 133
340 :1454
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class ExecutionPolicy, class F> void erase_if(ExecutionPolicy&& policy, F f); ``` 98/10000 · 98