Similar to std::stack, with the following differences:
- Maximum size is fixed at compilation time, so an array can be used.
- Can be cleared "at once", without reallocation.
More...
#include <pq_helpers.h>
List of all members.
Public Member Functions |
void | push (const value_type &x) |
const value_type & | top () const |
void | pop () |
void | clear () |
size_type | size () const |
bool | empty () const |
Detailed Description
template<typename Tp_, unsigned_type max_size_>
class priority_queue_local::internal_bounded_stack< Tp_, max_size_ >
Similar to std::stack, with the following differences:
- Maximum size is fixed at compilation time, so an array can be used.
- Can be cleared "at once", without reallocation.
The documentation for this class was generated from the following file: