37template<
class Type,
class Key>
40template<
class Type,
class Key>
Declaration and implementation of ArrayBuffer class.
void heapify(int i)
Is the central function to maintain the heap property.
AbaBHeap(int size)
A constructor.
int number() const
Returns the number of elements in the heap.
Type extractMin()
Accesses and removes the minimum element from the heap.
bool empty() const
Return true if there are no elements in the heap, false otherwise.
Key getMinKey() const
Returns the key of the minimum element of the heap.
int size() const
Returns the maximal number of elements which can be stored in the heap.
int father(int i) const
Returns the index of the father of element i.
void clear()
Empties the heap.
int rightSon(int i) const
Returns the index of the right son of node i.
void realloc(int newSize)
Changes the size of the heap.
AbaBHeap(const ArrayBuffer< Type > &elems, const ArrayBuffer< Key > &keys)
A constructor with initialization.
void insert(Type elem, Key key)
Inserts an item with a key into the heap.
Type getMin() const
Returns the minimum element of the heap.
void check() const
Throws an exception if the heap properties are violated.
int leftSon(int i) const
Returns the index of the left son of node i.
Base class of all other classes of ABACUS.
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
The parameterized class Array implements dynamic arrays of type E.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
std::ostream & operator<<(std::ostream &out, const Active< BaseType, CoType > &rhs)