priorityqueue.h

Go to the documentation of this file.

 
#pragma once
 
#include <cstddef>
#include <queue>
#include <vector>
#include <functional>
#include <promeki/core/namespace.h>
 
PROMEKI_NAMESPACE_BEGIN
 
template <typename T, typename Compare = std::less<T>>
class PriorityQueue {
        public:
                PriorityQueue() = default;
 
                PriorityQueue(const PriorityQueue &other) : d(other.d) {}
 
                PriorityQueue(PriorityQueue &&other) noexcept : d(std::move(other.d)) {}
 
                ~PriorityQueue() = default;
 
                PriorityQueue &operator=(const PriorityQueue &other) {
                        d = other.d;
                        return *this;
                }
 
                PriorityQueue &operator=(PriorityQueue &&other) noexcept {
                        d = std::move(other.d);
                        return *this;
                }
 
                // -- Capacity --
 
                bool isEmpty() const { return d.empty(); }
 
                size_t size() const { return d.size(); }
 
                // -- Access --
 
                const T &top() const { return d.top(); }
 
                // -- Modifiers --
 
                void push(const T &value) {
                        d.push(value);
                        return;
                }
 
                void push(T &&value) {
                        d.push(std::move(value));
                        return;
                }
 
                T pop() {
                        T val = d.top();
                        d.pop();
                        return val;
                }
 
                void swap(PriorityQueue &other) noexcept {
                        d.swap(other.d);
                        return;
                }
 
        private:
                std::priority_queue<T, std::vector<T>, Compare> d;
};
 
PROMEKI_NAMESPACE_END