DynamicPriorityQueue.h

Go to the documentation of this file.

#ifndef STORM_STORAGE_DYNAMICPRIORITYQUEUE_H_
#define STORM_STORAGE_DYNAMICPRIORITYQUEUE_H_
 
#include <algorithm>
#include <vector>
 
namespace storm {
namespace storage {
 
template<typename T, typename Container = std::vector<T>, typename Compare = std::less<T>>
class DynamicPriorityQueue {
   private:
    Container container;
    Compare compare;
 
   public:
    explicit DynamicPriorityQueue(Compare const& compare) : container(), compare(compare) {
        // Intentionally left empty
    }
    explicit DynamicPriorityQueue(Compare const& compare) : container(), compare(compare) {…}
 
    explicit DynamicPriorityQueue(Container&& container, Compare const& compare) : container(std::move(container)), compare(compare) {
        std::make_heap(container.begin(), container.end(), compare);
    }
    explicit DynamicPriorityQueue(Container&& container, Compare const& compare) : container(std::move(container)), compare(compare) {…}
 
    void fix() {
        std::make_heap(container.begin(), container.end(), compare);
    }
    void fix() {…}
 
    bool empty() const {
        return container.empty();
    }
    bool empty() const  {…}
 
    std::size_t size() const {
        return container.size();
    }
    std::size_t size() const  {…}
 
    const T& top() const {
        return container.front();
    }
    const T& top() const  {…}
 
    void push(const T& item) {
        container.push_back(item);
        std::push_heap(container.begin(), container.end(), compare);
    }
    void push(const T& item) {…}
 
    void push(T&& item) {
        container.push_back(std::move(item));
        std::push_heap(container.begin(), container.end(), compare);
    }
    void push(T&& item) {…}
 
    void pop() {
        std::pop_heap(container.begin(), container.end(), compare);
        container.pop_back();
    }
    void pop() {…}
 
    T popTop() {
        T item = top();
        pop();
        return item;
    }
    T popTop() {…}
 
    Container getContainer() const {
        return container;
    }
    Container getContainer() const  {…}
};
class DynamicPriorityQueue {…};
}  // namespace storage
}  // namespace storm
 
#endif  // STORM_STORAGE_DYNAMICPRIORITYQUEUE_H_