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

382 :1391
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — reserve 7/10000 · 7
:1348 :1348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
382 :1579
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ``` 92/10000 · 92
382 :1582
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Interface 16/10000 · 16
382 :1455
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the table's hash function or comparison function. Concurrency:;; Blocking on `*this`. --- 176/10000 · 176
382 :1355
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — reserve 7/10000 · 7
382 :1456
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` hasher hash_function() const; ``` 37/10000 · 37
382 :1455
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Changes if necessary the size of the bucket array 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. 268/10000 · 268
382 :1351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& x, const unordered_multiset<Key, Hash, Pred, Alloc>& y); ``` 190/10000 · 190
382 :1450
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_flat_map<Key, T, Hash, Pred, Alloc>& x, const unordered_flat_map<Key, T, Hash, Pred, Alloc>& y); ``` 205/10000 · 205
383 :1483
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ mapped_type& at(const key_type& k); const mapped_type& at(const key_type& k) const; template<class K> mapped_type& at(const K& k); template<class K> const mapped_type& at(const K& k) const; ``` 200/10000 · 200
383 :1392
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void reserve(size_type n); ``` 37/10000 · 37
383 :1350
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — erase_if 8/10000 · 8
383 :1584
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Extracts the element with key equivalent to `k`, if it exists. 62/10000 · 62
383 :1584
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — bucket_count 12/10000 · 12
383 :1459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — reserve 7/10000 · 7
383 :1356
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void reserve(size_type n); ``` 37/10000 · 37
383 :1461
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The table's hash function. 37/10000 · 37
383 :1457
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. 172/10000 · 172
383 :1357
	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