<hash_set> functions
swap
Note
This API is obsolete. The alternative is unordered_set Class.
Exchanges the elements of two hash_sets.
void swap(
hash_set <Key, Traits, Allocator>& left,
hash_set <Key, Traits, Allocator>& right);
Parameters
right
The hash_set providing the elements to be swapped, or the hash_set whose elements are to be exchanged with those of the hash_set left.
left
The hash_set whose elements are to be exchanged with those of the hash_set right.
Remarks
The swap template function is an algorithm specialized on the container class hash_set to execute the member function left.swap(right). This is an instance of the partial ordering of function templates by the compiler. When template functions are overloaded in such a way that the match of the template with the function call is not unique, then the compiler will select the most specialized version of the template function. The general version of the template function
template <class T> void swap(T&, T&),
in the algorithm class works by assignment and is a slow operation. The specialized version in each container is much faster as it can work with the internal representation of the container class.
Example
See the code example for the member class hash_set::swap for an example that uses the template version of swap.
swap (hash_multiset)
Note
This API is obsolete. The alternative is unordered_set Class.
Exchanges the elements of two hash_multisets.
void swap(hash_multiset <Key, Traits, Allocator>& left, hash_multiset <Key, Traits, Allocator>& right);
Parameters
right
The hash_multiset providing the elements to be swapped, or the hash_multiset whose elements are to be exchanged with those of the hash_multiset left.
left
The hash_multiset whose elements are to be exchanged with those of the hash_multiset right.
Remarks
The swap template function is an algorithm specialized on the container class hash_multiset to execute the member function left.swap(right). This is an instance of the partial ordering of function templates by the compiler. When template functions are overloaded in such a way that the match of the template with the function call is not unique, then the compiler will select the most specialized version of the template function. The general version of the template function
template <class T> void swap(T&, T&),
in the algorithm class works by assignment and is a slow operation. The specialized version in each container is much faster as it can work with the internal representation of the container class.
Example
See the code example for the member class hash_multiset::swap for an example that uses the template version of swap.