Exchanges the elements of two sets.
template<class Key, class Traits, class Allocator> void swap( set< Key, Traits, Allocator>& _Left, set< Key, Traits, Allocator>& _Right );
The template function is an algorithm specialized on the container class 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.
See the code example for the member class set::swap for an example of the use of the template version of swap.