Priority_Queue.H

# ifndef AH_PRIORITY_QUEUE_H
# define AH_PRIORITY_QUEUE_H

# include <tpl_dynBinHeap.H>

namespace Aleph {

    template <typename T, class Compare = Aleph::less<T> >
class priority_queue : private Aleph::DynBinHeap<T, Compare>
{
public:

  typedef T value_type;

  priority_queue() { /* empty */ }

      template <class Container>
  priority_queue(Container & cont)
  {
    const typename Container::iterator end = cont.end();

    for (typename Container::iterator it(cont.begin()); 
         it != end; this->insert(*it++));
  }

      template <class Itor>
  priority_queue(Itor beg, const Itor & end)
  {
    Aleph::verify_iterators (beg, end);

    while (beg != end)
      this->insert(*beg++);
  }

  T & push(const T & value) { return this->insert(value); }

  void pop() { this->getMin(); }

  const T & top() { return Aleph::DynBinHeap<T, Compare>::top(); }

  bool empty() const { return this->is_empty(); }

  size_t size() const { return Aleph::DynBinHeap<T, Compare>::size(); }
};

} // end namespace Aleph

# endif // AH_PRIORITY_QUEUE_H