template<typename _Tp, typename _Sequence = std::vector<_Tp>, typename _Compare = std::less<typename _Sequence::value_type>>
class priority_queue_local::internal_priority_queue< _Tp, _Sequence, _Compare >
Similar to std::priority_queue, with the following differences:
- Maximum size is fixed at construction time, so an array can be used.
- Provides access to underlying heap, so (parallel) sorting in place is possible.
- Can be cleared "at once", without reallocation.
template<typename _Tp, typename _Sequence = std::vector<_Tp>, typename _Compare = std::less<typename _Sequence::value_type>>
Removes first element.
This is a typical queue operation. It shrinks the queue by one. The time complexity of the operation depends on the underlying sequence.
Note that no data is returned, and if the first element's data is needed, it should be retrieved before pop() is called.