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.
#include <priority_queue.h>
Inheritance diagram for priority_queue_local::internal_bounded_stack< Tp_, max_size_ >:
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:
