std::priority_queue::swap

From Cppreference

C++ Standard Library
Language Utilities library Strings library Containers library Algorithms library Iterators library Numerics library Input/output library Localizations library Regular expressions library (C++11) Atomic operations library (C++11) Thread support library (C++11)
Containers library
array (C++11) vector deque forward_list (C++11) list set multiset map multimap unordered_set (C++11) unordered_multiset (C++11) unordered_map (C++11) unordered_multimap (C++11) stack queue priority_queue
std::priority_queue
Member functions priority_queue::priority_queue priority_queue::~priority_queue priority_queue::operator= Element access priority_queue::top Capacity priority_queue::empty priority_queue::size Modifiers priority_queue::push priority_queue::emplace priority_queue::pop priority_queue::swap

void swap{ const priority_queue<T, Container, Compare>& other );

Exchanges the contents of the container adaptor with those of other. Effectively calls using std::swap; swap(c, other.c); swap(comp, other.comp);

Contents 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

other

-

container adaptor to exchange the contents with

[edit] Return value

(none)

[edit] Complexity

Same as underlying container (linear if Container is std::array, constant otherwise)

[edit] See also

std::swap(std::priority_queue)	specializes the std::swap algorithm (function template)