std::priority_queue<T,Container,Compare>::~priority_queue - cppreference.com
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
| Member functions | ||||
| Element access | ||||
| Capacity | ||||
| Modifiers | ||||
(C++23) | ||||
(C++11) | ||||
(C++11) | ||||
| Non-member functions | ||||
(C++11) | ||||
| Helper classes | ||||
| Deduction guides(C++17) |
~priority_queue(); |
(constexpr since C++26) | |
Destroys the priority_queue. The destructors of the elements are called (in unspecified order) and the dynamically allocated storage (if any) is deallocated. Note, that if the elements are pointers, the pointed-to objects are not destroyed.
Complexity
Linear in the size of the priority_queue.