std::swap(std::priority_queue)
From cppreference.com
< cpp | container | priority queue
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).
Contents |
[edit] Parameters
lhs, rhs | - | containers whose contents to swap |
[edit] Return value
(none)
[edit] Complexity
Same as swapping the underlying container.
[edit] See also
swaps the contents (public member function) |