
|
Template Class
|
#include "boost/p_queue.hpp"
template <class T,
class Cont = std::vector<T>,
class Comp = std::less<typename Cont::value_type> >
class boost::priority_queue
{
public:
typedef typename Cont::value_type value_type;
typedef typename Cont::size_type size_type;
typedef Cont container_type;
typedef typename Cont::reference reference;
typedef typename Cont::const_reference const_reference;
typedef typename Cont::iterator iterator;
typedef typename Cont::const_iterator const_iterator;
explicit priority_queue(Comp const& comp = Comp());
bool empty() const;
size_type size() const;
const_reference top() const;
void push(const_reference val);
void pop();
void change_top(const_reference val);
const_iterator begin() const;
const_iterator end() const;
};
|
The basic method to maintain the internal data structure is identical to that
of d-heaps but for
For a description of the methods of See Also
heap(3),
heap-common(3)