|
#include <pqueue.h>
template<typename Key, typename Data, typename Compare = less<Key>>
class std::pqueue< Key, Data, Compare >
Definition at line 35 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
template<typename Key , typename Data , typename Compare = less<Key>>
Default constructor, creates empty priority queue.
Definition at line 101 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
template<typename Key , typename Data , typename Compare = less<Key>>
template<typename Key , typename Data , typename Compare = less<Key>>
bool std::pqueue< Key, Data, Compare >::empty |
( |
| ) |
const |
|
inline |
Returns true if the pqueue is empty.
Definition at line 123 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Returns size of queue.
Definition at line 129 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Returns key of queue item.
Definition at line 135 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Returns data of queue item.
Definition at line 144 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Returns queue item at top (with lowers key).
Definition at line 153 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Inserts a new entry into the queue, returns new item
Definition at line 159 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Reduces the key a queue item.
Definition at line 180 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
Removes the topmost item from the queue.
Definition at line 193 of file pqueue.h.
template<typename Key , typename Data , typename Compare = less<Key>>
void std::pqueue< Key, Data, Compare >::remove |
( |
node * |
item | ) |
|
|
inline |
Removes the item from the queue
Definition at line 200 of file pqueue.h.
|