std::swap(std::priority_queue)

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

		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 1 Parameters 2 Return value 3 Complexity 4 See also

[edit] Parameters

lhs, rhs

-

containers whose contents to swap

[edit] Return value

(none)

[edit] Complexity

Same as swapping the underlying container

[edit] See also

swap	swaps the contents (public member function)