寻路基本工具类定义 PriorityQueue.h

#ifndef __PRIORITYQUEUE__H
#define __PRIORITYQUEUE__H

#include <deque>

template<typename T, typename Pr = std::less<T>, typename Container = std::deque<T> >
class PriorityQueue
{
public:
    bool empty() const
    {
        return (m_container.empty());
    }

    unsigned int size() const
    {
        return (m_container.size());
    }

    const T top() const
    {
        return m_container.front();
    }

    T top()
    {
        return m_container.front();
    }

    void push(const T &val)
    {
        Container::const_iterator iter = m_container.begin();
        for(; iter != m_container.end(); ++iter)
        {
            if(!m_cmp(*iter, val))
            {
                break;
            }
        }
        m_container.insert(iter, val);
    }

    void pop()
    {
        m_container.pop_front();
    }

    void remove(const T &val)
    {
        Container::iterator iter;
        for(iter = m_container.begin(); iter != m_container.end(); ++iter)
        {
            if((*iter) == val)
            {
                m_container.erase(iter);
                break;
            }
        }
    }
private:
    Container   m_container;
    Pr          m_cmp;
};

#endif