[priqueue.special] (original) (raw)

23 Containers library [containers]

23.6 Container adaptors [container.adaptors]

23.6.4 Class template priority_queue [priority.queue]

23.6.4.5 Specialized algorithms [priqueue.special]

🔗

template<class T, class Container, class Compare> constexpr void swap(priority_queue<T, Container, Compare>& x, priority_queue<T, Container, Compare>& y) noexcept(noexcept(x.swap(y)));

1

#

Constraints: is_swappable_v<Container> is true andis_swappable_v<Compare> is true.

2

#

Effects: As if by x.swap(y).