Exit Zen
196
:806
English
```c++ template<class K> std::pair<iterator, bool> insert(K&& k); ```
103/690 · 69
206
:847
English
```c++ iterator insert(const_iterator hint, value_type&& obj); ```
74/660 · 66
212
:868
English
```c++ template<class K> iterator insert(const_iterator hint, K&& k); ```
92/730 · 73
233
:936
English
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
115/920 · 92
238
:953
English
```c++ insert_return_type insert(node_type&& nh); ```
61/530 · 53
244
:978
English
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
72/640 · 64
257
:1025
English
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
111/880 · 88
277
:1086
English
```c++ void swap(unordered_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value && boost::is_nothrow_swappable_v<Hash> && boost::is_nothrow_swappable_v<Pred>); ```
236/1900 · 190
288
:1117
English
```c++ template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); ```
530/3740 · 374
314
:1184
English
```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); template<class K> const_iterator find(const K& k) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator find(CompatibleKey const& k, CompatibleHash const& hash, CompatiblePredicate const& eq) const; ```
688/5980 · 598
395
:1429
English
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
231/1800 · 180
400
:1443
English
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
231/1800 · 180
405
:1457
English
```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(unordered_set<Key, Hash, Pred, Alloc>& x, unordered_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
243/1920 · 192
411
:1476
English
```c++ template<class K, class H, class P, class A, class Predicate> typename unordered_set<K, H, P, A>::size_type erase_if(unordered_set<K, H, P, A>& c, Predicate pred); ```
214/1740 · 174
The translation has come to an end.