|
|
typedef Container::iterator | iterator |
|
typedef Container::const_iterator | const_iterator |
|
|
| priority_queue (priority_queue &&) noexcept=default |
|
priority_queue & | operator= (priority_queue &&) noexcept=default |
|
| priority_queue (const priority_queue &)=delete |
|
priority_queue & | operator= (const priority_queue &)=delete |
|
iterator | begin () |
|
iterator | end () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
T & | operator[] (size_t i) |
|
const T & | operator[] (size_t i) const |
| auto | extract_top () |
| | Extract the top element from the priority queue and remove it from the queue.
|
◆ extract_top()
template<typename T, typename Container = std::vector<T>, typename Compare = std::less<typename Container::value_type>>
Extract the top element from the priority queue and remove it from the queue.
- Returns
- T The top element of the priority queue
The documentation for this class was generated from the following file:
- src/dsf/utility/queue.hpp