std::priority_queue<T,Container,Compare>::~priority_queue (3) - Linux Manuals
std::priority_queue<T,Container,Compare>::~priority_queue: std::priority_queue<T,Container,Compare>::~priority_queue
Command to display std::priority_queue<T,Container,Compare>::~priority_queue manual in Linux: $ man 3 std::priority_queue<T,Container,Compare>::~priority_queue
NAME
std::priority_queue<T,Container,Compare>::~priority_queue - std::priority_queue<T,Container,Compare>::~priority_queue
Synopsis
~priority_queue();
Destructs the container adaptor. The destructors of the elements are called and the used storage is deallocated. Note, that if the elements are pointers, the pointed-to objects are not destroyed.
Complexity
Linear in the size of the container adaptor.
Pages related to std::priority_queue<T,Container,Compare>::~priority_queue
- std::priority_queue<T,Container,Compare>::emplace (3) - std::priority_queue<T,Container,Compare>::emplace
- std::priority_queue<T,Container,Compare>::empty (3) - std::priority_queue<T,Container,Compare>::empty
- std::priority_queue<T,Container,Compare>::operator= (3) - std::priority_queue<T,Container,Compare>::operator=
- std::priority_queue<T,Container,Compare>::pop (3) - std::priority_queue<T,Container,Compare>::pop
- std::priority_queue<T,Container,Compare>::priority_queue (3) - std::priority_queue<T,Container,Compare>::priority_queue
- std::priority_queue<T,Container,Compare>::push (3) - std::priority_queue<T,Container,Compare>::push
- std::priority_queue<T,Container,Compare>::size (3) - std::priority_queue<T,Container,Compare>::size
- std::priority_queue<T,Container,Compare>::swap (3) - std::priority_queue<T,Container,Compare>::swap
- std::priority_queue<T,Container,Compare>::top (3) - std::priority_queue<T,Container,Compare>::top
- std::priority_queue (3) - std::priority_queue
- std::printf,std::fprintf,std::sprintf,std::snprintf (3) - std::printf,std::fprintf,std::sprintf,std::snprintf
- std::prev (3) - std::prev