Exit Zen
64
:412
English
```c++ unordered_node_set(unordered_node_set&& other); ```
66/580 · 58
81
:455
English
```c++ unordered_node_set(unordered_node_set&& other, Allocator const& a); ```
90/780 · 78
85
:470
English
```c++ unordered_node_set(concurrent_node_set<Key, Hash, Pred, Allocator>&& other); ```
111/870 · 87
137
:627
English
```c++ unordered_node_set& operator=(unordered_node_set&& other) noexcept((boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*>::value); ``` The move assignment operator. Destroys previously existing elements, swaps the hash function and predicate from `other`, and move-assigns the allocator from `other` if `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`. If at this point the allocator is equal to `other.get_allocator()`, the internal bucket array of `other` is transferred directly to the new container; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:unordered_node_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff the final allocator is equal to `other.get_allocator()`, and always calls `other.reset_stats()`.
784/10270 · 1027
191
:790
English
```c++ std::pair<iterator, bool> insert(value_type&& obj); ```
85/620 · 62
196
:807
English
```c++ template<class K> std::pair<iterator, bool> insert(K&& k); ```
103/690 · 69
206
:844
English
```c++ iterator insert(const_iterator hint, value_type&& obj); ```
74/660 · 66
212
:863
English
```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ```
124/900 · 90
228
:912
English
```c++ insert_return_type insert(node_type&& nh); ```
61/530 · 53
237
:930
English
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
72/640 · 64
247
:966
English
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
111/880 · 88
268
:1024
English
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
115/920 · 92
282
:1061
English
```c++ template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>&& source); ```
287/2030 · 203
369
:1307
English
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_node_set<Key, T, Hash, Pred, Alloc>& x, const unordered_node_set<Key, T, Hash, Pred, Alloc>& y); ```
259/2050 · 205
374
:1321
English
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const unordered_node_set<Key, T, Hash, Pred, Alloc>& x, const unordered_node_set<Key, T, Hash, Pred, Alloc>& y); ```
259/2050 · 205
378
:1333
English
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(unordered_node_set<Key, T, Hash, Pred, Alloc>& x, unordered_node_set<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
271/2170 · 217
384
:1351
English
```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_node_set<K, T, H, P, A>::size_type erase_if(unordered_node_set<K, T, H, P, A>& c, Predicate pred); ```
242/1990 · 199
The translation has come to an end.