std::swap(std::priority_queue) (3) Linux Manual Page

std::swap(std::priority_queue) – std::swap(std::priority_queue)

Synopsis

template <class T, class Container, class Compare>

void swap(priority_queue<T, Container, Compare> &lhs, (until C++ 17)

                                                          priority_queue<T, Container, Compare> &rhs);

template <class T, class Container, class Compare>

void swap(priority_queue<T, Container, Compare> &lhs, (since C++ 17)

                                                          priority_queue<T, Container, Compare> &rhs) noexcept(/* see below */);

Specializes the std::swap algorithm for std::priority_queue. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).
This overload only participates in overload resolution if std::is_swappable<Container>::value and std::is_swappable<Compare>::value are both true. (since C++17)

Parameters

lhs, rhs – containers whose contents to swap

Return value

(none)

Complexity

Same as swapping the underlying container.

Exceptions

noexcept specification: (since C++17)
noexcept(noexcept(lhs.swap(rhs)))

See also

     swaps the contents
swap (public member function)