template< class T, class Container, class Compare >
void swap( priority_queue<T,Container,Compare>& lhs,
priority_queue<T,Container,Compare>& rhs );
Specializes the std::swap algorithm for std::priority_queue. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).
Parameters
lhs, rhs - containers whose contents to swap
Return value
(none).
Complexity
Same as swapping the underlying container.
Exceptions noexcept specification: