Class PriorityQueue

include/PriorityQueue.h:61–283

	
    template<typename KEY, typename T>
    class PriorityQueue {
	typedef std::multimap< KEY, T, SortCriteria<KEY> > CONTAINER;
	typedef typename std::multimap< KEY, T, SortCriteria<KEY> >::iterator CIter;    
			
    public:
				
	PriorityQueue() : mutex("priority_queue")
	{
	    mutex.init();
	}
			
	~PriorityQueue()
	{
	    mutex.destroy();
	}
			
	CONTAINER& getQueue() { return this->queue; }
	CIter begin() { return queue.begin(); }
	CIter end() { return queue.end(); }
	CIter lower_bound(const KEY time) { return queue.lower_bound(time); }
	CIter upper_bound(const KEY time) { return queue.upper_bound(time); }
			
	void lock()
	{
	    mutex.lock();
	}
			
	void unlock()
	{
	    mutex.unlock();
	}
			
	bool add(T val)
	{
	    mutex.lock();
				
	    CIter pos  = queue.insert(std::make_pair(val->getStartTime(),val));
				
#ifdef _DEBUG_QUEUE_
	    std::cout << "QUEUE[" << this << "] " << "Successfully Added Task. Size: " << queue.size() << " at startime " << val->getStartTime() << std::endl;
	    std::cout << "QUEUE[" << this << "] " << "Inserted as element " << (std::distance(queue.begin(),pos) + 1) << " in queue of size " << queue.size() << std::endl;
				
	    /*
	      std::cout << "-----------START----------" << std::endl;
	      pos = queue.begin(); 
	      CIter end = queue.end();
	      for( ;pos != end; ++pos) {
	      std::cout << pos->second->getStartTime() << std::endl;
	      }
	      std::cout << "------------END-----------" << std::endl;
	    */
#endif
	    mutex.unlock();
				
	    return true;
	}
			
	int erase(std::string label)