fmpriorityqueue.hpp

#ifndef FMPRIORITYQUEUE_H_
#define FMPRIORITYQUEUE_H_

#include <boost/heap/priority_queue.hpp>

#include <fast_methods/datastructures/fmcompare.hpp>

template <class cell_t = FMCell> class FMPriorityQueue{

    public:
        FMPriorityQueue () {}

        FMPriorityQueue (const int & n) { heap_.reserve(n); }

        virtual ~ FMPriorityQueue() {}

        void setMaxSize
        (const int & n) {
            heap_.reserve(n);
        }

        void push 
        (const cell_t * c) {
            heap_.push(c);
        }

        void increase
        (const cell_t * c) {
            heap_.push(c);
        }

        int popMinIdx
        () {
            const int idx = heap_.top()->getIndex();
            heap_.pop();
            return idx;
        }

        size_t size
        () const {
            return heap_.size();
        }

        void clear
        () {
            heap_.clear();
        }

        bool empty
        () const {
            return heap_.empty();
        }

    protected:
        boost::heap::priority_queue<const cell_t *, boost::heap::compare<FMCompare<cell_t> > > heap_;
};


#endif /* FMPRIORITYQUEUE_H_ */