NAME¶

std::swap(std::priority_queue) - std::swap(std::priority_queue)

Synopsis¶

Defined in header <queue>
template< class T, class Container, class Compare >
(since C++11)
void swap( std::priority_queue<T,Container,Compare>& lhs, (until C++17)

std::priority_queue<T,Container,Compare>& rhs );
template< class T, class Container, class Compare >

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

std::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 participates in overload resolution only if
std::is_swappable_v<Container> and std::is_swappable_v<Compare> are (since C++17)
both true.

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)))

Notes¶

Although the overloads of std::swap for container adaptors are introduced in C++11,
container adaptors can already be swapped by std::swap in C++98. Such calls to
std::swap usually have linear time complexity, but better complexity may be
provided.

Example¶

// Run this code

#include <algorithm>
#include <iostream>
#include <queue>

int main()
{
std::priority_queue<int> alice;
std::priority_queue<int> bob;

auto print = [](const auto & title, const auto &cont) {
std::cout << title << " size=" << cont.size();
std::cout << " top=" << cont.top() << '\n';
};

for (int i = 1; i < 4; ++i)
alice.push(i);
for (int i = 7; i < 11; ++i)
bob.push(i);

// Print state before swap
print("alice:", alice);
print("bob :", bob);

std::cout << "-- SWAP\n";
std::swap(alice, bob);

// Print state after swap
print("alice:", alice);
print("bob :", bob);
}

Output:¶

alice: size=3 top=3
bob : size=4 top=10
-- SWAP
alice: size=4 top=10
bob : size=3 top=3

See also¶

swap swaps the contents
(C++11) (public member function)