std::swap(std::priority_queue)
std::swap(std::priority_queue)
template< class T, class Container, class Compare >
void swap( priority_queue<T,Container,Compare>& lhs,
priority_queue<T,Container,Compare>& rhs );
| (until C++17) | |
template< class T, class Container, class Compare >
void swap( priority_queue<T,Container,Compare>& lhs,
priority_queue<T,Container,Compare>& rhs ) noexcept(/* see below */);
| (since C++17) |
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: noexcept(noexcept(lhs.swap(rhs))) | (since C++17) |
See also
| swaps the contents (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/priority_queue/swap2
