![]() |
API Documentation
|
#include <NDEVR/Buffer.h>Go to the source code of this file.
Classes | |
| class | BinaryHeap< t_comp_type, t_value_type, t_is_min > |
| A heap data structure that takes the form of a binary tree which is a common way of implementing priority queues. More... | |
Namespaces | |
| namespace | NDEVR |
Typedefs | |
| template<class t_comp_type , class t_value_type > | |
| using | MaxHeap = BinaryHeap<t_comp_type, t_value_type, false> |
| template<class t_comp_type , class t_value_type > | |
| using | MinHeap = BinaryHeap<t_comp_type, t_value_type, true> |