PriorityQueue.h

Go to the documentation of this file.

 
#ifndef PRIORITY_QUEUE_H
#define PRIORITY_QUEUE_H
 
#include "Heap.h"
#include "functional_base.h"
#include "RandomAccessContainer.h"
 
namespace dyno
{

 
    template <typename T, typename Container = dyno::RandomAccessContainer<T>, typename Compare = dyno::less<typename Container::value_type> >
    class priority_queue
    {
    public:
        typedef priority_queue<T, Container, Compare>        this_type;
        typedef Container                                    container_type;
        typedef Compare                                      compare_type;
 
        typedef typename Container::value_type               value_type;
        typedef typename Container::reference                reference;
        typedef typename Container::const_reference          const_reference;
        typedef typename Container::size_type                size_type;
        typedef typename Container::difference_type          difference_type;
 
    public:
        container_type  container;
    private:
        compare_type    cmp;
 
    public:
        DYN_FUNC priority_queue();
        DYN_FUNC ~priority_queue();
 
        DYN_FUNC explicit priority_queue(const container_type& c);
 
        DYN_FUNC explicit priority_queue(const compare_type& compare);
 
        DYN_FUNC explicit priority_queue(const container_type& c, const compare_type& compare);
 
        DYN_FUNC inline bool empty() const;
 
        DYN_FUNC inline bool isEmpty() const;
 
        DYN_FUNC size_type size() const;
 
        DYN_FUNC const_reference top() const;
 
        DYN_FUNC void push(const value_type& value);
 
        DYN_FUNC void pop();
 
        DYN_FUNC void clear();
 
        DYN_FUNC void change(size_type n);
 
        DYN_FUNC void remove(size_type n);
 
    }; //priority_queue
 
 
}
#include "PriorityQueue.inl"
#endif