FakeHeap< T > Class Template Reference

#include <fakeheap.H>

Inheritance diagram for FakeHeap< T >:

Collaboration diagram for FakeHeap< T >:

List of all members.

Public Member Functions

void clear ()

bool empty () const

void sort (void)

void push (const T &x)

void pop (void)

const T & top (void) const

Detailed Description

template<class T>
class FakeHeap< T >

This template class provides an interface much like a priority queue, and it is intended to be used in this manner but with some restrictions and extensions.

Implementation details are hidden to provide an abstract template class for various fast implementations.

Use push() to push elements to the FakeHeap.
Use top() to (read-only) access the top element of the FakeHeap
Use pop() to pop elements from the FakeHeap.
You must use sort() between blockwise usage of push() and pop() to guarantee that the elements are accessed by their priority.
Use clear() to clear the FakeHeap.

Remarks:: Of course you could use a simple vector for these operations, too, but then the interface would be different; and FakeHeap was designed to replace priority queues in a manner that you can easily switch between these abstract data types. (The only reason for the existence of FakeHeap is that it produces a practical speedup compared to priority queues.)

Definition at line 58 of file fakeheap.H.