Priority Queue which is based on a List. The order of the elements is defined by a compare function which is provided in the constructor. If the function returns > 0 if v1 > v2, the data will be provided in increasing order.
More...
#include <CodecOpusOgg.h>
template<class T>
class audio_tools::audio_tools::PriorityQueue< T >
Priority Queue which is based on a List. The order of the elements is defined by a compare function which is provided in the constructor. If the function returns > 0 if v1 > v2, the data will be provided in increasing order.
- Author
- Phil Schatzmann
- Copyright
- GPLv3
- Template Parameters
-
◆ PriorityQueue() [1/2]
template<class T>
| PriorityQueue |
( |
int(* | compare )(T &v1, T &v2) | ) |
|
|
inline |
◆ PriorityQueue() [2/2]
template<class T>
| PriorityQueue |
( |
int(* | compare )(T &v1, T &v2) | ) |
|
|
inline |
◆ clear() [1/2]
◆ clear() [2/2]
◆ dequeue() [1/2]
◆ dequeue() [2/2]
◆ empty() [1/2]
◆ empty() [2/2]
◆ enqueue() [1/2]
template<class T>
| bool enqueue |
( |
T && | data | ) |
|
|
inline |
◆ enqueue() [2/2]
template<class T>
| bool enqueue |
( |
T && | data | ) |
|
|
inline |
◆ peek() [1/2]
◆ peek() [2/2]
◆ setAllocator() [1/2]
◆ setAllocator() [2/2]
◆ size() [1/2]
◆ size() [2/2]
◆ compare_cb
template<class T>
| int(* compare_cb)(T &v1, T &v2) |
|
protected |
The documentation for this class was generated from the following files: