bprioqueue.inc

Go to the documentation of this file.

 
#pragma once
 
namespace abacus {
 
 
template<class Type, class Key>
AbaPrioQueue<Type, Key>::AbaPrioQueue(int size) : heap_(size)
{ }
 
 
template<class Type, class Key>
void AbaPrioQueue<Type, Key>::insert(Type elem, Key key)
{
    heap_.insert(elem, key);
}
 
 
template<class Type, class Key>
int AbaPrioQueue<Type, Key>::getMin(Type &min) const
{
    if (heap_.empty()) return 1;
 
    min = heap_.getMin();
    return 0;
}
 
 
template<class Type, class Key>
int AbaPrioQueue<Type, Key>::getMinKey(Key &minKey) const
{
    if (heap_.empty()) return 1;
 
    minKey = heap_.getMinKey();
    return 0;
}
 
 
template<class Type, class Key>
int AbaPrioQueue<Type, Key>::extractMin(Type& min)
{
    if (heap_.empty()) return 1;
 
    min = heap_.extractMin();
    return 0;
}
 
 
template<class Type, class Key>
void AbaPrioQueue<Type, Key>::clear()
{
    heap_.clear();
}
 
 
template<class Type, class Key>
inline int AbaPrioQueue<Type, Key>::size() const
{
    return heap_.size();
}
 
 
template<class Type, class Key>
inline int AbaPrioQueue<Type, Key>::number() const
{
    return heap_.number();
}
 
 
template<class Type, class Key>
void AbaPrioQueue<Type, Key>::realloc(int newSize)
{
    if (newSize < size()) {
        Logger::ifout() << "AbaPrioQueue::realloc : priority queue cannot be decreased\n";
        OGDF_THROW_PARAM(AlgorithmFailureException, ogdf::AlgorithmFailureCode::BPrioQueue);
    }
 
    heap_.realloc(newSize);
}
 
}