PriorityQueue.hxx

Go to the documentation of this file.

#ifndef PRIORITY_QUEUE_HXX_
#define PRIORITY_QUEUE_HXX_
 
#include <vector>
#include <algorithm>
 
template <typename T, typename Comparator = std::less<T>> class PriorityQueue
{
public:
  using Container = std::vector<T>;
  using container_type = Container;
  using value_compare = Comparator;
  using value_type = typename Container::value_type;
  using size_type = typename Container::size_type;
  using reference = typename Container::reference;
  using const_reference = typename Container::const_reference;
  using allocator_type = typename Container::allocator_type;
  using different_type = typename Container::difference_type;
  using pointer = typename Container::pointer;
  using const_pointer = typename Container::const_pointer;
  using iterator = typename Container::iterator;
  using const_iterator = typename Container::const_iterator;
 
  bool empty() const noexcept;
 
  reference top();
 
  const_reference top() const;
 
  void push(value_type &&element);
 
  void push(const value_type &element);
 
  void pop();
 
  template <typename Predicate> size_type erase_if(Predicate &&predicate);
 
  void clear(void) noexcept;
 
private:
  Container m_container;
};
 
#include "PriorityQueue.inl.hxx"
 
#endif // PRIORITY_QUEUE_HXX_