priority_queue.hpp

#ifndef TERMOX_COMMON_PRIORITY_QUEUE_HPP
#define TERMOX_COMMON_PRIORITY_QUEUE_HPP
#include <cstdint>
#include <queue>
#include <vector>
 
#include <termox/common/lockable.hpp>
 
namespace ox {
 
 
template <typename T, typename Priority = std::uint8_t>
class Priority_queue {
   public:
    using Priority_t = Priority;
 
   public:
    [[nodiscard]] auto top() const -> T const& { return queue_.top().second; }
 
    [[nodiscard]] auto is_empty() const -> bool { return queue_.empty(); }
 
    [[nodiscard]] auto size() const -> std::size_t { return queue_.size(); }
 
    void push(Priority p, T const& x) { queue_.push(std::pair{p, x}); }
 
    void push(Priority p, T&& x) { queue_.push(std::pair{p, std::move(x)}); }
 
    auto pop() -> T
    {
        auto result = std::move(const_cast<T&>(this->top()));
        queue_.pop();
        return std::move(result);
    }
 
   private:
    using Value_t = std::pair<Priority, T>;
 
   private:
    struct Compare {
        [[nodiscard]] auto operator()(Value_t const& x, Value_t const& y) const
            -> bool
        {
            return x.first < y.first;
        }
    };
 
   private:
    using Queue_t = std::priority_queue<Value_t, std::vector<Value_t>, Compare>;
    Queue_t queue_;
};
}  // namespace ox
#endif  // TERMOX_COMMON_PRIORITY_QUEUE_HPP